Segment Tracing Using Local Lipschitz Bounds
| dc.contributor.author | Galin, Eric | en_US |
| dc.contributor.author | Guérin, Eric | en_US |
| dc.contributor.author | Paris, Axel | en_US |
| dc.contributor.author | Peytavie, Adrien | en_US |
| dc.contributor.editor | Panozzo, Daniele and Assarsson, Ulf | en_US |
| dc.date.accessioned | 2020-05-24T12:54:08Z | |
| dc.date.available | 2020-05-24T12:54:08Z | |
| dc.date.issued | 2020 | |
| dc.description.abstract | We introduce Segment Tracing, a new algorithm that accelerates the classical Sphere Tracing method for computing the intersection between a ray and an implicit surface. Our approach consists in computing the Lipschitz bound locally over a segment to improve the marching step computation and accelerate the overall process. We describe the computation of the Lipschitz bound for different operators and primitives. We demonstrate that our algorithm significantly reduces the number of field function queries compared to previous methods, without the need for additional accelerating data-structures. Our method can be applied to a vast variety of implicit models ranging from hierarchical procedural objects built from complex primitives, to simulation-generated implicit surfaces created from many particles. | en_US |
| dc.description.number | 2 | |
| dc.description.sectionheaders | Spatial Queries | |
| dc.description.seriesinformation | Computer Graphics Forum | |
| dc.description.volume | 39 | |
| dc.identifier.doi | 10.1111/cgf.13951 | |
| dc.identifier.issn | 1467-8659 | |
| dc.identifier.pages | 545-554 | |
| dc.identifier.uri | https://doi.org/10.1111/cgf.13951 | |
| dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf13951 | |
| dc.publisher | The Eurographics Association and John Wiley & Sons Ltd. | en_US |
| dc.rights | Attribution 4.0 International License | |
| dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | |
| dc.title | Segment Tracing Using Local Lipschitz Bounds | en_US |