TL;DR
The paper introduces a new, efficient algorithm for computing generalized winding numbers in 3D, achieving high accuracy and speed for complex surfaces, suitable for large-scale and interactive applications.
Contribution
A novel formulation and discretization method that significantly improves speed and maintains accuracy in computing 3D winding numbers for meshes and parametric surfaces.
Findings
Achieves 22x speedup on CPU over existing precise methods.
Reaches 10^9 queries per second on GPU, enabling real-time applications.
On average 5.6x faster than previous methods for parametric surfaces.
Abstract
Generalized winding numbers provide a robust measure of point insidedness for 3D surfaces - whether open, self-intersecting, or non-manifold - and are central to numerous geometry processing tasks. However, existing methods trade off between accuracy and computational efficiency, limiting their use in interactive and large-scale applications. We introduce a new formulation and algorithm for computing generalized winding numbers that is both fast and accurate to arbitrary precision, applicable to meshes and parametric surfaces. Our approach expresses the winding number as the sum of two intuitive geometric quantities: the signed number of ray-surface intersections and a boundary integral over the surface's projection onto the unit sphere. This insight leads to an efficient discretization that avoids expensive surface integrals and spherical arrangements. For meshes, our method…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
