Erratum: A Robust and Efficient Intersection Algorithm for NURBS Surfaces: Handling Small Loops and Tangent Intersections
A formal erratum has been published for the ACM Transactions on Graphics paper on robust and efficient intersection of NURBS surfaces, with the correction tied to the handling of small loops and tangent intersections. That puts a spotlight on one of the nastiest corners of computational geometry: cases where surfaces barely touch, overlap in tiny regions, or produce numerically unstable intersection curves.
For game developers, this is most relevant anywhere high-precision surface math shows up, especially CAD-to-engine pipelines, procedural modeling, technical art tools, and custom geometry libraries. Intersection bugs in these scenarios can cascade into broken meshes, bad trims, failed imports, or expensive fallback logic, so even a narrow correction can matter if your tools depend on this class of algorithm.
The paper appears in ACM Transactions on Graphics, Volume 45, Issue 5, page 1-1, dated October 2026. The exact technical correction and its downstream impact on implementations haven’t been broadly detailed here, but the existence of an erratum is a useful signal for teams evaluating the method for production use.
If your pipeline touches NURBS or other trimmed-surface workflows, this is a reminder to treat intersection robustness as a shipping concern, not an academic footnote. Edge cases like tangent contact and tiny loops are where geometry code usually earns or loses trust.
- what
- An erratum was issued for a paper on robust and efficient NURBS surface intersection, focused on small loops and tangent intersections.
- who
- Published in ACM Transactions on Graphics.
- when
- Volume 45, Issue 5, page 1-1, October 2026.
- impact
- Relevant to graphics and tools teams building robust geometry, CAD import, or modeling workflows.
It's a correction notice, useful but not celebratory.
Follow graphics updates
See relevant stories in your personalized news feed.
Discussion