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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barnhill, R.E., Farin, G., Jordan, M., Piper, B.R.: Surface/surface intersection. Computer Aided Geometric Design 4, 3–6 (1987)
Barnhill, R.E., Kersey, S.N.: A marching method for parametric surface/surface intersection. Computer Aided Geometric Design 17, 257–280 (1990)
Biermann, H., Kristjansson, D., Zorin, D.: Approximate Boolean operations for subdivision surfaces. In: Proc. SIGGRAPH 2001, pp. 185–194 (2001)
Catmull, E., Clark, J.: Recursively generated B-spline surfaces on arbitrary topological meshes. Computer Aided Design 10(6), 350–355 (1978)
Doo, D., Sabin, M.: Analysis of the behavior of recursive division surfaces near extraordinary points. Computer Aided Design 10(6), 257–268 (1978)
Grinspun, E., Schröder, P.: Normal bounds for subdivision-surface interference detection. In: Proc. IEEE Scientific Visualization (2001)
Hohmeyer, M.: A surface intersection algorithm based on loop detection. International Journal of Computational Geometry and Applications 1(4), 473–490 (1991)
Hu, S.M., Sun, J.G., Jin, T.G., Wang, G.Z.: Computing the parameters of points on NURBS curves and surfaces via moving affine frame method. Journal of Software 11(1), 49–53 (2000)
Kobbelt, L.: \(\sqrt{3}\) subdivision. In: SIGGRAPH 2000 proceedings, pp. 103–112 (2000)
Krishnan, S., Manocha, D.: An efficient surface intersection algorithm based on lower dimensional formulation. ACM transactions on Graphics 16(1) (1997)
Litke, N., Levin, A., Schröder, P.: Trimming for Subdivision Surfaces. Technical report, Caltech (2000)
Loop, C.T.: Smooth Subdivision Surfaces Based on Triangles. M.S. Thesis, Department of Mathematics, University of Utah (1987)
Nasri, A.H.: Polyhedral Subdivision Methods for Free-form Surfaces. ACM Trans. Graphics 6(1), 29–73 (1987)
Seidel, R.: The nature and meaning of perturbations in geometric computing. Discrete and Computational Geometry 19(1), 1–17 (1998)
Stam, J.: Exact evaluation of Catmull-Clark subdivision surfaces at arbitrary parameter values. In: Proc. SIGGRAPH 1998, pp. 395–404 (1998)
Stam, J.: Evaluation of Loop subdivision surfaces. In: SIGGRAPH 1999 Course Notes (1999)
Zorin, D., Schröder, P.: Subdivision for modeling and animation. In: SIGGRAPH 2000 Course Notes (2000)
Zorin, D., Kristjansson, D.: Evaluation of piecewise smooth subdivision surfaces. Visual Computer (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhu, XP., Hu, SM., Tai, CL., Martin, R.R. (2005). A Marching Method for Computing Intersection Curves of Two Subdivision Solids. In: Martin, R., Bez, H., Sabin, M. (eds) Mathematics of Surfaces XI. Lecture Notes in Computer Science, vol 3604. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11537908_28
Download citation
DOI: https://doi.org/10.1007/11537908_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28225-9
Online ISBN: 978-3-540-31835-4
eBook Packages: Computer ScienceComputer Science (R0)