An efficient surface intersection algorithm based on lower-dimensional formulation

ACM Transactions on Graphics - Tập 16 Số 1 - Trang 74-106 - 1997
Shankar Krishnan1, Dinesh Manocha1
1 University of North Carolina-Chapel Hill

Tóm tắt

We present an efficient algorithm to compute the intersection of algebraic and NURBS surfaces. Our approach is based on combining the marching methods with the algbraic formulation. In particular, we propose and matrix computations. We present algorithms to compute a start point on each component of the intersection curve (both open and closed components), detect the presence of singularities, and find all the curve branches near the singularity. We also suggest methods to compute the step size during tracing to prevent component jumping. The algorithm runs an order of magnitude faster than previously published robust algorithms. The complexity of the algorithm is output sensitive.

Từ khóa


Tài liệu tham khảo

10.1016/0167-8396(88)90011-8

10.1145/964967.801152

10.1016/0167-8396(88)90010-6

10.1016/0167-8396(90)90035-P

CHENG K.P., Theory and Practice of Geometric Modeling

COLLINS G.E., Lecture Notes in Computer Science, number 33

DIXON A. L., 1908, The eliminant of three quantics in two independent variables, Proc. London Math. Soc., 6, 49

DOKKEN T., 1985, Finding intersections of b-spline represented geometries using recursive subdivision techniques, Comput. Aided Geom. Des., 2, 189, 10.1016/0167-8396(85)90024-X

DOKKEN T., Mathematical Methods in Computer-Aided Geometric Design

10.1016/0734-189X(86)90115-5

10.1016/0167-8396(87)90012-4

GEISOW A. 1983. Surface interrogations. School of Computing Studies and Accountancy University of East Anglia Ph.D. thesis. GEISOW A. 1983. Surface interrogations. School of Computing Studies and Accountancy University of East Anglia Ph.D. thesis.

GOHBERG I. LANCASTER P. AND RODMAN L. 1982. Matrix Polynomials. Academic Press New York. GOHBERG I. LANCASTER P. AND RODMAN L. 1982. Matrix Polynomials. Academic Press New York.

GOLUB G. H. AND VAN LOAN C. F. 1989. Matrix Computations. John Hopkins Press Baltimore. GOLUB G. H. AND VAN LOAN C. F. 1989. Matrix Computations. John Hopkins Press Baltimore.

HOFFMANN C.M. 1989. Geometric and Solid Modeling. Morgan-Kaufmann San Mateo CA. HOFFMANN C.M. 1989. Geometric and Solid Modeling. Morgan-Kaufmann San Mateo CA.

10.1016/0167-8396(90)90013-H

HOHMEYER M. E., 1991, A surface intersection algorithm based on loop detection, Int. J. Comput. Geom. Appl., 1, 473, 10.1142/S021819599100030X

KLASSEN E., 1985, Proceedings of ACM Symposium on Computational Geometry, 39-45

KRIEZIS G. A., 1990, Topological and differential equation methods for surface intersections, Comput. Aided Des., 24, 41, 10.1016/0010-4485(92)90090-W

10.1016/0010-4485(90)90011-Z

KRISHNAN S., 1996, Proceedings of CSG'96, 101

LANE M., 1980, A theoretical development for the computer generation and display of piecewise polynomial surfaces, IEEE Trans. Pattern Anal. Mach. Intell., 2, 150

10.1016/0010-4485(86)90130-2

MANOCHA D. 1992. Algebraic and numeric techniques for modeling and robotics. Computer Science Division Department of Electrical Engineering and Computer Science University of California Berkeley May Ph.D. thesis. MANOCHA D. 1992. Algebraic and numeric techniques for modeling and robotics. Computer Science Division Department of Electrical Engineering and Computer Science University of California Berkeley May Ph.D. thesis.

MANOCHA D., 1994, Proceedings of International Symposium on Symbolic and Algebraic Computation, 1

10.1109/38.267470

MANOCHA D., 1991, A new approach for surface intersection, Int. J. Comput. Geom. Appl., 1, 491, 10.1142/S0218195991000311

MANOCHA D. AND KRISHNAN S. 1997. Algebraic pruning: A fast technique for curve and surface intersections. Comput. Aided Geom. Des. (to appear). 10.1016/S0167-8396(97)00008-3 MANOCHA D. AND KRISHNAN S. 1997. Algebraic pruning: A fast technique for curve and surface intersections. Comput. Aided Geom. Des. (to appear). 10.1016/S0167-8396(97)00008-3

10.1109/38.180122

10.1016/0010-4485(89)90045-6

PRATT M.J., The Mathematics of Surfaces II

10.1109/38.156011

10.1147/rd.313.0296

SARRAGA R. F., 1983, Algebraic methods for intersection, Comput. Vis. Graph. Image Process., 22, 222, 10.1016/0734-189X(83)90066-X

SEDERBERG T.W. 1983. Implicit and parametric curves and surfaces. Purdue University Ph.D. thesis. SEDERBERG T.W. 1983. Implicit and parametric curves and surfaces. Purdue University Ph.D. thesis.

10.1016/0167-8396(88)90029-5

10.1016/0167-8396(91)90036-B

SEIDEL R., 1990, Proceedings of the 6th Annual ACM Conference on Computational Geometry, 211

SNYDER J., 1992, Proceedings of ACM Siggraph

ZUNDEL A., 1993, SIAM Conference on Geometric Design