A marching method for computing intersection curves of two subdivision solids

Authors:
Xu-Ping Zhu;Shi-Min Hu;Chiew-Lan Tai;Ralph R. Martin
Affiliations:
Department of Computer Science and Technology, Tsinghua University, Beijing, China;Department of Computer Science and Technology, Tsinghua University, Beijing, China;Department of Computer Science, Hong Kong University of Science and Technology, Hong Kong, China;School of Computer Science, Cardiff University, Cardiff, Wales
Venue:
IMA'05 Proceedings of the 11th IMA international conference on Mathematics of Surfaces
Year:
2005

Citing 8
Cited 0

Polyhedral subdivision methods for free-form surfaces

ACM Transactions on Graphics (TOG)
Surface/surface intersection

Computer Aided Geometric Design - Special issue: Topics in CAGD
A marching method for parametric surface/surface intersection

Computer Aided Geometric Design
An efficient surface intersection algorithm based on lower-dimensional formulation

ACM Transactions on Graphics (TOG)
Exact evaluation of Catmull-Clark subdivision surfaces at arbitrary parameter values

Proceedings of the 25th annual conference on Computer graphics and interactive techniques
√3-subdivision

Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Approximate Boolean operations on free-form solids

Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Normal bounds for subdivision-surface interference detection

Proceedings of the conference on Visualization '01

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a marching method for computing intersection curves between two solids represented by subdivision surfaces of Catmull-Clark or Loop type. It can be used in trimming and boolean operations for subdivision surfaces. The main idea is to apply a marching method with geometric interpretation to trace the intersection curves. We first determine all intersecting regions, then find pairs of initial intersection points, and trace the intersection curves from the initial intersection points. Various examples are given to demonstrate the robustness and efficiency of our algorithm.