Ray Tracing Harmonic Functions
Mark Gillespie, Denise Yang, Mario Botsch, Keenan Crane
Abstract
Sphere tracing is a fast and high-quality method for visualizing surfaces encoded by signed distance functions (SDFs). We introduce a similar method for a completely different class of surfaces encoded by harmonic functions , opening up rich new possibilities for visual computing. Our starting point is similar in spirit to sphere tracing: using conservative Harnack bounds on the growth of harmonic functions, we develop a Harnack tracing algorithm for visualizing level sets of harmonic functions, including those that are angle-valued and exhibit singularities. The method takes much larger steps than naïve ray marching, avoids numerical issues common to generic root finding methods and, like sphere tracing, needs only perform pointwise evaluation of the function at each step. For many use cases, the method is fast enough to run real time in a shader program. We use it to visualize smooth surfaces directly from point clouds (via Poisson surface reconstruction) or polygon soup (via generalized winding numbers) without linear solves or mesh extraction. We also use it to visualize nonplanar polygons (possibly with holes), surfaces from architectural geometry, mesh "exoskeletons", and key mathematical objects including knots, links, spherical harmonics, and Riemann surfaces. Finally we show that, at least in theory, Harnack tracing provides an alternative mechanism for visualizing arbitrary implicit surfaces.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers3
- Points as Tori: Fast Pointwise Signed Distance for Point CloudsNicole Feng, Ioannis Gkioulekas, Keenan CraneSIGGRAPH 2026 · 1 citation
- Semantics of Integrating and Differentiating SingularitiesJesse Michel, Wonyeol Lee, Hongseok YangPLDI 2025
- Subgrid Marching TetrahedraHossein Baktash, Mark Gillespie, Keenan CraneSIGGRAPH 2026
Builds on15
- Differentiable signed distance function renderingDelio Vicini, Sébastien Speierer, Wenzel JakobSIGGRAPH 2022 · 112 citations
- Flexible Isosurface Extraction for Gradient-Based Mesh OptimizationTianchang Shen, Jacob Munkberg, Jon Hasselgren, Kangxue Yin et al.SIGGRAPH 2023 · 100 citations
- Monte Carlo geometry processing: a grid-free approach to PDE-based methods on volumetric domainsRohan Sawhney, Keenan CraneSIGGRAPH 2020 · 99 citations
- Walk on Stars: A Grid-Free Monte Carlo Method for PDEs with Neumann Boundary ConditionsRohan Sawhney, Bailey Miller, Ioannis Gkioulekas, Keenan CraneSIGGRAPH 2023 · 48 citations
- Grid-free Monte Carlo for PDEs with spatially varying coefficientsRohan Sawhney, Dario Seyb, Wojciech Jarosz, Keenan CraneSIGGRAPH 2022 · 46 citations
Related papers
- Sphere Carving: Bounding Volumes for Signed Distance FieldsHugo Schott, Theo Thonat, Thibaud Lambert, Eric Guérin et al.SIGGRAPH 2025 · 4 citations
- The Antipodal Method: Fast, Accurate, and Robust 3D Generalized Winding NumbersCedric Martens, Philip Trettner, Mikhail BessmeltsevSIGGRAPH 2026
- DIST: Rendering Deep Implicit Signed Distance Function With Differentiable Sphere TracingShaohui Liu, Yinda Zhang, Songyou Peng, Boxin Shi et al.CVPR 2020
- The PhaseTree: Multiphase Signed Distance FieldsEric Galin, Pierre Hubert-briere, Marie-Paule Cani, Adrien Peytavie et al.SIGGRAPH 2026
- MASH: Masked Anchored SpHerical Distances for 3D Shape Representation and GenerationChanghao Li, Yu Xin, Xiaowei Zhou, Ariel Shamir et al.SIGGRAPH 2025 · 2 citations
