Curve intersection using Bézier clipping
暂无分享,去创建一个
[1] Richard F. Riesenfeld,et al. A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[2] S. Mudur,et al. A new class of algorithms for the processing of parametric curves , 1983 .
[3] R. L. Magedson,et al. Solutions of tangential surface and curve intersections , 1989 .
[4] Wolfgang Böhm,et al. A survey of curve and surface methods in CAGD , 1984, Comput. Aided Geom. Des..
[5] Xuguang Wang,et al. Rational hodographs , 1987, Comput. Aided Geom. Des..
[6] Dana H. Ballard,et al. Strip trees: a hierarchical representation for curves , 1981, CACM.
[7] T. Sederberg,et al. Improved test for closed loops in surface intersections , 1989 .
[8] Pierre Bezier,et al. The Mathematical Basis of the Unisurf CAD System , 1986 .
[9] Wayne E. Carlson. An algorithm and data structure for 3D object synthesis using surface patch intersections , 1982, SIGGRAPH.
[10] Thomas W. Sederberg,et al. Fat arcs: A bounding region with cubic convergence , 1989, Comput. Aided Geom. Des..
[11] T. Sederberg,et al. Comparison of three curve intersection algorithms , 1986 .
[12] Gerald Farin,et al. Curves and surfaces for computer aided geometric design , 1990 .