A 3D Curvilinear Skeletonization Algorithm with Application to Path Tracing

Chaussard, John; Noël, Laurent; Biri, Venceslas; Couprie, Michel

doi:10.1007/978-3-642-37067-0_11

Cited by 3 publications

(5 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first part occurs during initialization and computes the topological data structure. First we voxelize the scene and we apply a thinning process [19] to compute a centered curvilinear skeleton from the voxels filling the empty space (where light travels, see Fig. 2).…”

Section: Overviewmentioning

confidence: 99%

“…A curvilinear skeleton is then computed from the empty space of the voxelization (voxels that does not cover surfaces) with a thinning process. We guaranty that the skeleton is centered and has the same topology that the empty space by using an algorithm that process in the cubical complex framework [19]. The thinning process outputs a graph embedded in 3D space and a 3D grid that gives for each voxel the index of the nearest node of the skeleton (with respect to the geometry of the empty space).…”

Section: A Voxelization and Thinningmentioning

confidence: 99%

“…In our implementation all this pre-computation is done on CPU. We plan to implement our thinning algorithm on GPU, expecting strong improvement in performance due to the parallel nature of the algorithm [19].…”

Section: A Precomputationmentioning

confidence: 99%

See 2 more Smart Citations

Real-Time Global Illumination for Games using Topological Information

Noël¹,

Biri²

2014

7th Annual International Conference on Computer Games Multimedia and Allied Technologies (CGAT 2014)

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Overviewmentioning

confidence: 99%

Section: A Voxelization and Thinningmentioning

confidence: 99%

See 1 more Smart Citation

Real-Time Global Illumination for Games using Topological Information

Noël¹,

Biri²

2014

7th Annual International Conference on Computer Games Multimedia and Allied Technologies (CGAT 2014)

Self Cite

View full text Add to dashboard Cite

show abstract

“…In particular, for light transport simulation, the shape of the empty space (medium in which the light travels) can be analized to develop efficient rendering algorithms. Surprisingly, just few attempts have been made to use such tools in the rendering community [4,5,6].…”

Section: Introductionmentioning

confidence: 99%

Portal Extraction Based on an Opening Labeling for Ray Tracing

Noël¹,

Biri²

2015

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

International audienceRendering photo-realistic images from a 3D scene description remains a challenging problem when processing complex geometry exposing many occlusions. In that case, simulating light propagation requires hours to produce a correct image. An opening map can be used to extract information from the geometry of the empty space of a scene, where light travels. It describes local thickness and allows to identify narrow regions that are difficult to traverse with ray tracing. We propose a new method to extract portals in order to improve rendering algorithms based on ray tracing. This method is based on the opening map, which is used to define a labeling of the empty space. Then portals-2D surfaces embedded in empty space-are extracted from labeled regions. We demonstrate that those portals can be sampled in order to explore the scene efficiently with ray tracing

show abstract

“…In our case the scene is first voxelized then complemented to get a voxelization of the empty space. One can choose any thinning algorithm available but we decided to use the topological thinning algorithm described by Chaussard et al [CNBC13]. To obtain a centered skeleton, this algorithm removes voxels from the voxelized object one layer at a time, starting at the border and in parallel for each layer.…”

Section: Introductionmentioning

confidence: 99%

Skeleton based Vertex Connection Resampling for Bidirectional Path Tracing

Noël

Biri

2015

Computer Graphics Forum

Self Cite

View full text Add to dashboard Cite

Figure 1: A comparison between standard BPT and BPT improved with our connection resampling strategy (after 60 seconds of rendering). In this setting, the draperies occlude most of the light vertices from the eye vertices, resulting in many null contributions. Our resampling favors connections that are more likely to produce a high contribution. AbstractBidirectional path tracing is known to perform poorly for the rendering of highly occluded scenes. Indeed, the connection strategy between light and eye subpaths does not take into account the visibility factor, presenting no contribution for many sampled paths. To improve the efficiency of bidirectional path tracing, we propose a new method for adaptive resampling of connections between light and eye subpaths. Aiming for this objective, we build discrete probability distributions of light subpaths based on a skeleton of the empty space of the scene. In order to demonstrate the efficiency of our algorithm, we compare our method to both standard bidirectional path tracing and a recent important caching method.

show abstract

A 3D Curvilinear Skeletonization Algorithm with Application to Path Tracing

Cited by 3 publications

References 10 publications

Real-Time Global Illumination for Games using Topological Information

Real-Time Global Illumination for Games using Topological Information

Portal Extraction Based on an Opening Labeling for Ray Tracing

Skeleton based Vertex Connection Resampling for Bidirectional Path Tracing

Contact Info

Product

Resources

About