Hidden curve removal for free form surfaces

This paper describes a hidden curve algorithm specifically designed for sculptured surfaces. A technique is described to extract the visible curves for a given scene without the need to approximate the surface by polygons. This algorithm produces higher quality results than polygon based algorithms, as most of the output set has an exact representation. Surface coherence is used to speed up the process. Although designed for sculptured surfaces, this algorithm is also suitable for polygonal data.

[1]  T. Sederberg,et al.  Comparison of three curve intersection algorithms , 1986 .

[2]  Christoph Hornung.  A Method for Solving the Visibility Problem , 1984, IEEE Computer Graphics and Applications.

[3]  Claudio Montani,et al.  Vector and Raster Hidden-Surface Removal Using Parallel Connected Stripes , 1987, IEEE Computer Graphics and Applications.

[4]  MontaniClaudio,et al.  Vector and Raster Hidden-Surface Removal Using Parallel Connected Stripes , 1987 .

[5]  John R. Rankin.  A geometric hidden-line processing algorithm , 1987, Comput. Graph..

[6]  Ralf Hartmut Güting,et al.  New algorithms for special cases of the hidden line elimination problem , 1987, Comput. Vis. Graph. Image Process..

[7]  R. Galimberti,et al.  An algorithm for hidden line elimination , 1969, CACM.

[8]  Jiri Kripac,et al.  Classification of edges and its application in determining visibility , 1985 .

[9]  Tom Lyche,et al.  Discrete B-splines and subdivision techniques in computer-aided geometric design and computer graphics , 1980 .

[10]  Thomas W. Sederberg,et al.  Loop detection in surface patch intersections , 1988, Comput. Aided Geom. Des..

[11]  Richard H. Bartels,et al.  Ray Tracing Free-Form B-Spline Surfaces , 1986, IEEE Computer Graphics and Applications.

[12]  C. William Gear,et al.  Raster-scan hidden surface algorithm techniques , 1977, SIGGRAPH '77.

[13]  E SutherlandIvan,et al.  A Characterization of Ten Hidden-Surface Algorithms , 1974 .

[14]  Michael McKenna.  Worst-case optimal hidden-surface removal , 1987, TOGS.

[15]  Satoru Kawai,et al.  An enhanced treatment of hidden lines , 1987, TOGS.

[16]  Ralf Hartmut Güting,et al.  New algorithms for special cases of the hidden line elimination problem , 1985, Comput. Vis. Graph. Image Process..

[17]  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.

[18]  Christoph Hornung.  An approach to a calculation-minimized hidden line algorithm , 1982, Comput. Graph..

[19]  Philippe P. Loutrel.  A Solution to the Hidden-Line Problem for Computer-Drawn Polyhedra , 1970, IEEE Transactions on Computers.

[20]  L. Li.  Hidden-line algorithm for curved surfaces , 1988 .

[21]  Arthur Appel,et al.  The notion of quantitative invisibility and the machine rendering of solids , 1967, ACM National Conference.

[22]  James D. Foley,et al.  Fundamentals of interactive computer graphics , 1982 .

[23]  James F. Blinn.  A scan line algorithm for displaying parametrically defined surfaces , 1978, SIGGRAPH.

[24]  Carlo H. Séquin,et al.  Visible Feature Return at Object Resolution , 1985, IEEE Computer Graphics and Applications.

[25]  Michael F. Cohen,et al.  Automatic illustration of 3D geometric models: lines , 1990, I3D '90.

[26]  Otto Nurmi.  A fast line-sweep algorithm for hidden line elimination , 1985, BIT Comput. Sci. Sect..

[27]  Wolfgang Straßer,et al.  An area-oriented analytical visibility method for displaying parametrically defined tensor-product surfaces , 1985, Comput. Aided Geom. Des..

[28]  M LaneJeffrey,et al.  A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces , 1980 .