Abstract
A new approach for a reliable subdivision algorithm for the intersection of parametric surfaces is presented. Bounding volumes for surface patches like axis aligned bounding boxes or parallel epipeds used in former approaches are replaced by linear interval estimations (LIE).
Two different types of LIEs are proposed, based in one case on a linear taylor approximation of the patch and an interval estimation of the Lagrange remainder and in the second case on the use of the intrinsic structure of affine arithmetic. Both approaches guarantee that a patch lies completely inside its estimation. Taking advantage of the characteristics of LIEs, the intersection test for bounding volumes is replaced by a method, that directly tests the intersection of the estimations and as a by-product, it prunes both parameter domains in a way, that only relevant parts of the domains are subdivided in the next step.
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
K. Bühler. Über den Schnitt zweier Linearer Intervallabschätz–ungen. Technical Report TR–186–2–01–07, Institute of Computer Graphics and Algorithms, Vienna University of Technology, 2001.
H. Bürger and R. Schaback. A parallel multistage method for surface/surface intersection. CAGD, 10 (3): 277–292, August 1993.
L.H. de Figueiredo. Surface intersection using affine arithmetic. In Wayne A. Davis and Richard Bartels, editors, Graphics Interface ‘86, pages 168–175, 1996.
D. Filip, R. Magedson, and R. Markot. Surface algorithms using bounds on derivatives. CAGD, 3 (4): 295–311, 1986.
M. Gleicher and M. Kass. An interval refinement technique for surface intersection. In Graphics Interface ‘82, pages 242–249, 1992.
J. Hoschek and D. Lasser. Grundlagen der geometrischen Datenverarbeitung. B.G. Teubner Stuttgart, 2 edition, 1992.
C.-Y. Hu, T. Maekawa, N.M. Patrikalakis, and X. Ye. Robust interval algorithm for surface intersections. CAD, 29 (9): 617–627, 1997.
E. Huber and W. Barth. Surface-to-surface intersection with complete and guaranteed results. In T. Csendes, editor, Developments in Reliable Computing, pages 185–198. Kluwer, 1999.
J.M. Snyder, A.R. Woodbury, K. Fleischer, B. Currin, and A.H. Barr. Interval methods for multi-point collisions between time-dependent curved surfaces. Computer Graphics, 27: 321–334, 1993.
W. Knüppel. Bias - basic interval arithmetic subroutines. Technical Report 93.3, TU Hamburg Harburg, Technische Informatik I I, 1993.
K. Makin and M. Berz. Efficient control of the dependency problem based on taylor model methodes. Reliable Computing, 5: 3–12, 1999.
P. Schramm Sichere Verschneidung von Kurven und Flächen im CAGD. PhD thesis, Universität Karlsruhe, Fakultät für Mathematik, 1995.
J. Stolfi and L.H. de Figueiredo. Self-Validated Numerical Methods and Applications. 1997. Course Notes for the 21th Brazilian Mathematics Colloquium held at IMAP, July 1997.
R. van Iwaarden and J. Stolfi. Affine arithmetic sofware. http://www.math.cudenver.edulvan/Software.html, 1997.
S.-W. Wang, Z.-C. Shih, and R.-C. Chang. An improved rendering technique for ray tracing Bézier and B-spline surfaces. Journal of Visualization and Computer Animation, 11 (4): 209–219, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Bühler, K., Barth, W. (2001). A New Intersection Algorithm for Parametric Surfaces Based on Linear Interval Estimations. In: Krämer, W., von Gudenberg, J.W. (eds) Scientific Computing, Validated Numerics, Interval Methods. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6484-0_15
Download citation
DOI: https://doi.org/10.1007/978-1-4757-6484-0_15
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-3376-8
Online ISBN: 978-1-4757-6484-0
eBook Packages: Springer Book Archive