Abstract
Detecting intersecting surfaces and computing their intersection curves is one of the fundamental problems in solid modeling algebra. This paper introduces a new strategy to classify pairs of surfaces according to their intersection status, where exact geometric entities are replaced by fuzzy ones. Intersecting surfaces are thus replaced by fuzzy intersecting faces and a fuzzy intersection algorithm provides a 3-State classification of pairs of surfaces: certainly intersecting, certainly non-intersecting and potentially intersecting.
In the case of certainly intersecting surface couples the fuzzy intersaction algorithm provides also starting points to march along the intersection curve, which turns most of the potentially intersecting couples into certainly intersecting ones. The remaining potential intersections are then subdivided to refine their status. Statistics shows the efficiency of this global strategy.
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
C. Asteasu and A. Orbergozo. Parametric piecewise surface intersection. Computer & Graphics, 15(1):9–13, 1991.
N.M. Aziz, R. Bata, and S. Bhat. Bézier surface/surface intersection. IEEE Computer Graphics and Applications, pages 50–58, January 1990.
C.L. Bajaj, CM. Hoffmann, R.E. Lynch, and J.E.H. Hopcfart. Tracing surface intersections. Computer Aided Geometric Design, 12:285–307, 1988.
R.E. Barnhill, G. Farin, M. Jordan, and B.R. Piper. Surface/surface intersection. Computer Aided Geometric Design, 4(l-2):3–16, 1987.
R.E. Barnhill and S.N. Kersey. A marching method for parametric surface/surface intersection. Computer Aided Geometric Design, 7(1–4):257–280, 1990.
E. Boender. A survey of intersection algorithms for curved surfaces. Computer and Graphics, 15(1):109–115, 1991.
J.J. Chen and T.M. Ozsoy. Predictor-corrector type of intersection algorithm for C2 parametric surfaces. Computer Aided Design, 20(6):347–352, 1988.
K.-P. Cheng. Using plane vector fields to obtain all the intersection curves of two general surfaces. In W. Straßer and H.-P. Seidel, editors, Proc. Theory and practice of geometric modeling, pages 187–204, Springer-Verlag, 1989.
M. Daniel. Calcul d’une enveloppe des normales d’une surface definie par des pôles. Rapport de recherche no 43, Institut de Recherche en Informatique de Nantes, 93.
A. L. Dixon. The eliminant of three quantics in two independent variables. In Proceedings of London Mathematical Society, volume 6, pages 209–236, 1908.
Rida T. Farouki. Direct surface section evaluation. In Gerald E. Farin, editor, Geometric Modeling: Algorithms and New Trends, pages 319–335, Philadelphia, 1987. SIAM.
M.E. Hohmeyer. A surface intersection algorithm based on loop detection. International Journal of Computational Geometry and Applications, l(4):473–490, 1991. Surfaces Intersection for Solid Algebra: A Classification Algorithm.
E.G. Houghton, R.F. Emnett, J.D. Factor, and C. Sabharwal. Implementation of a divide-and-conquer method for intersection of parametric surfaces. Computer Aided Geometric Design, 2:173–183, 1985.
P.A. Koparkar and S.P. Mudur. Generation of smooth curves resulting from operations on parametric surface patches. Computer Aided Design, 18(4):193–206, 1986.
G. A. Kriezis. Algorithms for Rational Spline Surface Intersections. PhD thesis, Massachusetts Institute of Technology, Cambridge, USA, March 1990.
G.A. Kriezis, P.V. Prakash, and N.M. Patrikalakis. Method for intersecting algebraic surfaces with rational polynomial patches. Computer Aided Design, 22(10):645–655, 1990.
Shankar Krishnan and Dinesh Manocha. Algebraic loop detection and evaluation algorithms for curve and surface interogations. Technical Report TR95–038, Department of Computer Science, University of N. Carolina, Chapel Hill, 1995.
J.M. Lane and R.F. Riesenfeld. A theoritical development for the computer generation and display of piecewise polynomial surfaces. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2(1):150–159, 1980.
D. Lasser. Intersection of parametric surface in the Bernestein-Bézier representation. Computer Aided Design, 18(4):186–196, 1986.
D. Manocha and J.F. Canny. A new approach for surface intersection. International Journal of Computational Geometry and Applications, 1(4):491–516, 1991.
R.P. Markot and R.L. Magedson. Solutions of tangential surface and curve intersections. Computer Aided Design, 21(7):421–429, 1989.
N. M. Patrikalakis and P. V. Prakash. Surface intersections for geometric modeling. Journal of Mechanical Design, 112:100–107, mar 1990.
Q.S. Peng. An algorithm for finding the intersection between two B-spline surfaces. Computer Aided Design, 16(4):191–196, 1984.
M.J. Pratt and A.D. Geisow. Surface/surface intersection problems. In J.A. Gregory, editor, Proc. of the Mathematics of surfaces, pages 118–148, Oxford University Press, U.K., September 1984.
R. F. Sarraga. Algebraic methods for intersection. Computer Vision, Graphics and Image Processing, 22:222–283, 1983.
T. W. Sederberg. Implicit and Parametric Curves and Surfaces. PhD thesis, Purdue University, 1983.
T.W. Sederberg and R.J. Meyers. Loop detection in surface patch intersections. Computer Aided Geometric Design, 5(2):161–171, 1988.
T.W. Sederberg and T. Nishita. Curve intersection using Bézier clipping. C.A.D,, 22(9):538–549, November 1990.
L. A. Zadeh. Fuzzy sets. Information and Control, 8:338–353, 1965.
L. A. Zadeh. Fuzzy algorithms. Information and Control, 12:94–102, 1968.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Foufou, S., Brun, J.M., Bouras, A. (1997). Surfaces Intersection for Solid Algebra: A Classification Algorithm. In: Strasser, W., Klein, R., Rau, R. (eds) Geometric Modeling: Theory and Practice. Focus on Computer Graphics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60607-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-60607-6_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61883-6
Online ISBN: 978-3-642-60607-6
eBook Packages: Springer Book Archive