Abstract
We present an algorithm for the robust computation of the complete intersection curve of two general parametric surfaces based on interval arithmetic. The subdivision algorithm we introduce follows a divide-and-conquer-approach. It avoids loss of any parts of the intersection curve by using safe bounding volumes for all parts (patches) of the surfaces. For each pair of patches, it first checks for intersection of the bounding volumes. If two bounding volumes intersect, it splits one patch, and treats both new pairs recursively until a predefined termination condition is satisfied. We use parallelepipeds as tight bounding volumes. Each parallelepiped considers the shape and orientation of its patch, overestimating it only by second order terms. With the help of interval inclusions for the partial derivatives, we compute parts of the parameter domain, where one patch cannot reach the enclosure of the other one. Cutting off such dispensable regions, and corresponding parts in object space result in a faster convergence of the algorithm. Interval arithmetic is used for all critical operations to achieve robustness.
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
G. Alefeld and J. Herzberger. Introduction to Interval Computations. Academic Press, Inc., 1983. ISBN 0–12–049820–0.
R. Barnhill, G. Farin, M. Jordan, and B. Piper. Surface/Surface Intersection. Computer Aided Geometric Design, 4: 3–16, 1987.
W. Barth, R. Lieger, and M. Schindler. Ray Tracing General Parametric Surfaces Using Interval Arithmetic. The Visual Computer, 10 (7): 363–371, 1994.
M. Berz and G. Hofstätter. Computation and Application of Taylor Polynomials with Interval Reminder Bounds. Reliable Computing, 4 (1): 83–97, February 1998.
S. Gottschalk. Separating Axis Theorem. Technical Report TR96–024, Department of Computer Science, UNC Chapel Hill, 1996.
E.G. Houghton, R.F. Emnett, J.D. Factor, and Ch.L. Sabharwal. Implementation of a Divideand-Conquer Method for Intersection of Parametric Surfaces. Computer Aided Geometric Design, 2: 173–183, 1985.
E. Huber. Intersecting General Parametric Surfaces Using Bounding Volumes. In Tenth Canadian Conference on Computational Geometry - CCCG’98, 1998.
Knüppel. BIAS - Basic Interval Arithmetic Subroutines. Bericht des Forschungsschwerpunktes Informations-and Kommunikationstechnik, TU Hamburg-Harburg, July 1993.
D. Lasser. Kurven and Flächenverschneidungsmethoden. In J. L. Encarnaçâo, editor, Geometrische Verfahren der Graphischen Datenverarbeitung,pages 61–87. Springer Verlag, 1990. ISBN 3–540–53011–8.
A. Neumaier. Interval Methods for Systems of Equations. Cambridge University Press, Inc., 1990. ISBN 0–521–33196–X.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Huber, E., Barth, W. (1999). Surface-to-surface intersection with complete and guaranteed results. In: Csendes, T. (eds) Developments in Reliable Computing. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1247-7_15
Download citation
DOI: https://doi.org/10.1007/978-94-017-1247-7_15
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5350-3
Online ISBN: 978-94-017-1247-7
eBook Packages: Springer Book Archive