Presentation

<
A Robust and Efficient Intersection Algorithm for NURBS Surfaces: Handling Small Loops and Tangent Intersections
SessionParametric Surfaces
DescriptionThis paper presents a robust and efficient method for computing NURBS surface intersection curves, with emphasis on small loops and degenerate cases. By combining winding number theory with subdivision on the parametric domain, the method reliably detects starting points of all branches, improving topological correctness and computational efficiency in CAD.
Authors
Jieyin Yang
State Key Laboratory of Mathematical Sciences Academy of Mathematics and Systems Science Chinese Academy of Sciences University of Chinese Academy of Sciences
Xiaohong Jia
State Key Laboratory of Mathematical Sciences Academy of Mathematics and Systems Science Chinese Academy of Sciences University of Chinese Academy of Sciences
Presenter
Jieyin Yang
Key Laboratory of Mathematics Mechanization, Chinese Academy Of Sciences; University of Chinese Academy of Sciences
Event Type
Technical Paper
TimeTuesday, 21 July 20262:00pm - 2:10pm PDT
LocationRoom 403 B
Session Time & Location
Sunday, 19 July 20266:00pm - 8:45pm PDTHall K
Tuesday, 21 July 20262:00pm - 3:30pm PDTRoom 403 B
Keywords
Geometry
Modeling
Registration Categories
Full Conference Supporter
Full Conference
Next PresentationNext PresentationStress-Aware Panelization of Freeform Surfaces
Similar Presentations
Robust Containment Queries over Collections of Trimmed NURBS Surfaces via Generalized Winding Numbers
Spatially Accelerated Winding Numbers for Curved Geometry
NeuBase: Spline Surfaces with Neural Basis Functions