Abstract
This paper discusses an attempt to devise an efficient (involving minimal computations), accurate (numerically high precision), exhaustive (detecting all possible solutions), and robust (working without failures) method for detecting intersection of two parametric surfaces. The method starts with subdivision to ensure that all solutions are detected. Later it switches over to numerical iterative refinement for efficient and accurate evaluation of the intersection curve. The switching takes place only when the convergence of the refinement method is guaranteed. The necessary theory to arrive at a computable condition leading to this guarantee has been developed using fixed-point and contractionmapping theorems from topology and mathematical analysis. The implementation is discussed elaborating the data structures and the algorithms used for (1) detecting segments of the intersection curve, (2) generating points on these segments using refinement, and (3) tracing a continuous curve by identifying neighboring segments and joining them in order.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Acton FS (1970) Numerical methods that work. Harper and Row, New York
Cartan H (1963) Theory of analytic functions. Addison Wesley, New Jersey
Koparkar PA (1984) Computational techniques for processing parametric curves and surfaces. PhD thesis, University of Bombay
Koparkar PA, Mudur SP (1983) A new class of algorithms for the processing of parametric curves. Computer Aided Design, V. 15, No. 1, p. 41–45
Koparkar PA, Mudur SP (1984) Computational techniques for processing parametric surfaces. Computer Vision, Graphics, and Image Processing, V 28, p 303–322
Koparkar PA, Mudur SP (1986) Generation of continuous smooth curves resulting from operations on parametric surface patches. Computer Aided Design, V 18, No 4 p 193–206
Levin IZ (1979) Mathematical models for determining the intersections of quadric surfaces. Computer Graphics and Image Processing, V 19, p 73–78
Moore RE (1966) Interval analysis. Printice Hall, Engelwood Cliffs
Mudur SP, Koparkar PA (1984) Interval methods for processing geometric objects. IEEE Comput Graph Appl, 7
Rudin W (1964) Principles of mathematical analysis. McGraw Hill-Kogakusha
Samet H (1982) Neighbour finding techniques for images represented by quadtrees. Computer Graphics and Image Processing 18:37
Sederberg TW, Anderson DC, Goldman RN (1985) Implicitization, inversion, and intersection of planar rational cubic curves. Computer Vision, Graphics, and Image Processing 28:89
Smith C (1929) A treatise on algebra. Macmillan, London
Willard S (1970) General topology. Addison Wesley, New Jersey
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Koparkar, P. Surface intersection by switching from recursive subdivision to iterative refinement. The Visual Computer 8, 47–63 (1991). https://doi.org/10.1007/BF01900845
Issue Date:
DOI: https://doi.org/10.1007/BF01900845