Lipschitz Pruning: Hierarchical Simplification of Primitive‐Based SDFs.
Saved in:
| Title: | Lipschitz Pruning: Hierarchical Simplification of Primitive‐Based SDFs. |
|---|---|
| Authors: | Barbier, Wilhem1,2 (AUTHOR), Sanchez, Mathieu2 (AUTHOR), Paris, Axel2 (AUTHOR), Michel, Élie2 (AUTHOR), Lambert, Thibaud2 (AUTHOR), Boubekeur, Tamy2 (AUTHOR), Paulin, Mathias1 (AUTHOR), Thonat, Theo2 (AUTHOR) |
| Source: | Computer Graphics Forum. May2025, Vol. 44 Issue 2, p1-12. 12p. |
| Subjects: | Tree pruning, Graphics processing units, Ray tracing, Rendering (Computer graphics) |
| Abstract: | Rendering tree‐based analytical Signed Distance Fields (SDFs) through sphere tracing often requires to evaluate many primitives per tracing step, for many steps per pixel of the end image. This cost quickly becomes prohibitive as the number of primitives that constitute the SDF grows. In this paper, we alleviate this cost by computing local pruned trees that are equivalent to the full tree within their region of space while being much faster to evaluate. We introduce an efficient hierarchical tree pruning method based on the Lipschitz property of SDFs, which is compatible with hard and smooth CSG operators. We propose a GPU implementation that enables real‐time sphere tracing of complex SDFs composed of thousands of primitives with dynamic animation. Our pruning technique provides significant speedups for SDF evaluation in general, which we demonstrate on sphere tracing tasks but could also lead to significant improvement for SDF discretization or polygonization. [ABSTRACT FROM AUTHOR] |
| Copyright of Computer Graphics Forum is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | Rendering tree‐based analytical Signed Distance Fields (SDFs) through sphere tracing often requires to evaluate many primitives per tracing step, for many steps per pixel of the end image. This cost quickly becomes prohibitive as the number of primitives that constitute the SDF grows. In this paper, we alleviate this cost by computing local pruned trees that are equivalent to the full tree within their region of space while being much faster to evaluate. We introduce an efficient hierarchical tree pruning method based on the Lipschitz property of SDFs, which is compatible with hard and smooth CSG operators. We propose a GPU implementation that enables real‐time sphere tracing of complex SDFs composed of thousands of primitives with dynamic animation. Our pruning technique provides significant speedups for SDF evaluation in general, which we demonstrate on sphere tracing tasks but could also lead to significant improvement for SDF discretization or polygonization. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 01677055 |
| DOI: | 10.1111/cgf.70057 |
