Show simple item record

dc.contributor.authorGalin, Ericen_US
dc.contributor.authorGuérin, Ericen_US
dc.contributor.authorParis, Axelen_US
dc.contributor.authorPeytavie, Adrienen_US
dc.contributor.editorPanozzo, Daniele and Assarsson, Ulfen_US
dc.date.accessioned2020-05-24T12:54:08Z
dc.date.available2020-05-24T12:54:08Z
dc.date.issued2020
dc.identifier.issn1467-8659
dc.identifier.urihttps://doi.org/10.1111/cgf.13951
dc.identifier.urihttps://diglib.eg.org:443/handle/10.1111/cgf13951
dc.description.abstractWe 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.publisherThe Eurographics Association and John Wiley & Sons Ltd.en_US
dc.rightsAttribution 4.0 International License
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.titleSegment Tracing Using Local Lipschitz Boundsen_US
dc.description.seriesinformationComputer Graphics Forum
dc.description.sectionheadersSpatial Queries
dc.description.volume39
dc.description.number2
dc.identifier.doi10.1111/cgf.13951
dc.identifier.pages545-554


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution 4.0 International License
Except where otherwise noted, this item's license is described as Attribution 4.0 International License