Algebraic pruning: A fast technique for curve and surface intersection

Computer Aided Geometric Design

Volumn 14, Issue 9, 1997, Pages 823-845

  Manocha, Dinesh ^a   Krishnan, Shankar ^a  

^a University of North Carolina   (United States)

Author keywords

Curves; Eigendecomposition; Intersection; Ray tracing; Resultants; Solid modeling; Surfaces

Indexed keywords

ALGORITHMS; CALCULATIONS; COMPUTATIONAL GEOMETRY; COMPUTER GRAPHICS; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY;

ALGEBRAIC PRUNING; EIGENDECOMPOSITION; RAY TRACING; SOLID MODELS;

COMPUTER AIDED DESIGN;

EID: 0031377911     PISSN: 01678396     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8396(97)00008-3     Document Type: Article

References (22)

1. Anderson, E., Bai, Z., Bischof, C., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S. and Sorensen, D. (1992), LAPACK User's Guide, Release 1.0. SIAM, Philadelphia.
2. Dixon, A.L. (1908), The eliminant of three quantics in two independent variables, Proceedings of London Mathematical Society 6, 49-69, 209-236.
3. Elber, G. and Cohen, E. (1990), Hidden curve removal for free form surfaces, Computer Graphics 24, 95-104.
4. Farin, G. (1990), Curves and Surfaces for Computer Aided Geometric Design: A Practical Guide, Academic Press Inc.
5. Farouki, R.T. and Rajan, V.T. (1987), On the numerical condition of polynomials in Bernstein form, Computer Aided Geometric Design 4, 191-216.
6. Golub, G.H. and Van Loan, C.F. (1989), Matrix Computations, John Hopkins Press, Baltimore.
7. Hoffmann, C.M. (1989), Geometric and Solid Modeling, Morgan Kaufmann, San Mateo, CA.
8. Hoffmann, C.M. (1990), A dimensionality paradigm for surface interrogations, Computer Aided Geometric Design 7, 517-532.
9. Kajiya, J. (1982), Ray tracing parametric patches, Computer Graphics 16, 245-254.
10. Koparkar, P.A. and Mudur, S.P. (1983), A new class of algorithms for the processing of parametric curves, Computer-Aided Design 15, 41-45.
11. Lane, J.M. and Riesenfeld, R.F. (1980), A theoretical development for the computer generation and display of piecewise polynomial surfaces, IEEE Transactions on Pattern Analysis and Machine Intelligence 2, 150-159.
12. Manocha, D. (1992), Algebraic and numeric techniques for modeling and robotics, PhD thesis, Computer Science Division, Department of Electrical Engineering and Computer Science, University of California, Berkeley.
13. Manocha, D. and Demmel, J. (1994), Algorithms for intersecting parametric and algebraic curves, ACM Transactions on Graphics 13, 73-100.
14. Nishita, T., Sederberg, T.W. and Kakimoto, M. (1990), Ray tracing trimmed rational surface patches, Computer Graphics 24, 337-345.
15. Salmon, G. (1885), Lessons Introductory to the Modern Higher Algebra, G.E. Stechert and Co., New York.
16. Sederberg, T.W. (1983), Implicit and parametric curves and surfaces, PhD thesis, Purdue University.
17. Sederberg, T.W. (1989), Algorithms for algebraic curve intersection, Computer-Aided Design 21, 547-555.
18. Seidel, R. (1990), Linear programming and convex hulls made easy, in: Proc. 6th Ann. ACM Conf. on Computational Geometry, Berkeley, CA, 211-215.
19. Sederberg, T.W. and Parry, S.R. (1986), Comparison of three curve intersection algorithms, Computer-Aided Design 18, 58-63.
20. Sederberg, T.W., White, S. and Zundel, A. (1989), Fat arcs: a bounding region with cubic convergence, Computer Aided Geometric Design 6, 205-218.
21. Wilkinson, J.H. (1959), The evaluation of the zeros of ill-conditioned polynomials, parts I and II, Numer. Math. 1, 150-166, 167-180.
22. Wilkinson, J.H. (1965), The Algebraic Eigenvalue Problem, Oxford University Press, Oxford.