Recognition: unknown
The Antipodal Method: Fast, Accurate, and Robust 3D Generalized Winding Numbers
Pith reviewed 2026-05-09 13:42 UTC · model grok-4.3
The pith
The Antipodal Method decomposes generalized winding numbers into signed ray intersections plus a spherical boundary integral, delivering 22x CPU speedups over precise baselines and 10^9 queries per second on GPU for meshes.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
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.
Load-bearing premise
That the boundary integral over the spherical projection admits an efficient, precision-preserving discretization for arbitrary meshes and parametric surfaces without introducing hidden approximation errors or requiring post-hoc adjustments.
read the original 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 achieves average speedups of $22\times$ on a CPU compared to the fastest precise methods and $3\times$ compared to the fastest approximation method, while maintaining full precision. On a GPU, for moderately complex meshes we reach a throughput of $10^9$ queries per second, or $4K$ generalized winding number slices at 120 FPS ($13\times$ faster than a naive GPU method). For parametric surfaces, our method is on average $5.6\times$ faster than the state-of-the-art method, with the same precision. Our method naturally handles complex topologies and non-manifold inputs. We extensively validate its accuracy, robustness, and time performance. Our code is available at https://github.com/MartensCedric/antipodal.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper introduces the Antipodal Method for generalized winding numbers in 3D, reformulating the quantity exactly as the signed count of ray-surface intersections plus a boundary integral of the surface projected onto the unit sphere centered at the query point. This leads to an efficient discretization: analytic summation over projected great-circle arcs for triangle meshes, and quadrature/sampling for parametric surfaces. The method is claimed to deliver arbitrary precision, natural handling of non-manifold and self-intersecting inputs, average CPU speedups of 22× versus the fastest exact prior method and 3× versus the fastest approximation method for meshes, GPU throughput of 10^9 queries/s, and 5.6× speedup for parametric surfaces at equivalent precision.
Significance. If the central reformulation and discretization preserve the claimed exactness and arbitrary-precision guarantees, the work would be significant for geometry processing: it would provide a practical, high-throughput primitive for inside/outside queries on complex, open, and non-manifold surfaces that is faster than current exact and approximate baselines while remaining robust. The release of reproducible code strengthens the contribution.
major comments (2)
- [§4.3] §4.3 (Parametric-surface discretization): the claim that the boundary-integral discretization achieves 'arbitrary precision' and 'the same precision as state-of-the-art' for general parametric surfaces is not supported by an a-priori error bound. Projected boundary curves are no longer great-circle arcs; any quadrature or sampling scheme necessarily introduces truncation error whose magnitude depends on curvature after projection, parametrization quality, and query-point location. No analysis shows that the chosen scheme can be driven to machine epsilon independently of the input surface without hidden tolerances or post-processing.
- [§5.2] §5.2 (Parametric-surface experiments): the reported 5.6× average speedup with 'same precision' is presented without quantitative error tables or ground-truth comparisons for surfaces with high curvature or near-singular parametrizations. It is therefore impossible to verify whether the observed precision matches the exact methods or merely stays within a fixed tolerance that the authors consider acceptable.
minor comments (3)
- [Abstract] Abstract and §1: the phrase 'full precision' for meshes should be replaced by 'machine precision' or 'exact (up to floating-point rounding)' to avoid ambiguity.
- [§3.1] §3.1, Eq. (3): the definition of the spherical boundary integral would benefit from an explicit statement of the orientation convention and the precise differential form being integrated.
- [Figure 7] Figure 7 caption: the GPU timing comparison should state the mesh complexity (vertex and triangle counts) for the 4K-slice 120 FPS claim.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Generalized winding number equals signed ray intersections plus boundary integral of the spherical projection
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.