Efficient perspective-accurate silhouette computation and applications

Silhouettes are perceptually and geometrically salient features of geo metric models. Hence a number of graphics and visualization applications need to find them to aid further processing. The efficient computation of silhouettes, especially in the context of perspective projection, is known to be difficult. This paper presents a novel efficient and practical algorithm to compute silhouettes from a sequence of viewpoints under perspective projection. Parallel projection is a special case of this algorithm. Our approach is based on a point-plane duality in three dimensions, which allows an efficient computation of the \emph{changes} in the silhouette of a polygonal model between consecutive frames. In addition, we present several applications of our technique to problems from computer graphics and medical visualization. We also provide experimental data that show the efficiency of our approach. million vertices on an SGI Onyx workstation.

[1]  Hansong Zhang,et al.  Fast backface culling using normal masks , 1997, SI3D.

[2]  Aaron Hertzmann,et al.  Illustrating smooth surfaces , 2000, SIGGRAPH.

[3]  Dinesh Manocha,et al.  Hierarchical Back-Face Culling , 1996 .

[4]  Sung Kwon Kim.  Parallel Algorithms for the Segment Dragging Problem , 1990, Inf. Process. Lett..

[5]  Franco P. Preparata,et al.  Computational Geometry , 1985, Texts and Monographs in Computer Science.

[6]  Gershon Elber,et al.  Output sensitive extraction of silhouettes from polygonal geometry , 1999, Proceedings. Seventh Pacific Conference on Computer Graphics and Applications (Cat. No.PR00293).

[7]  Amitabh Varshney,et al.  Dynamic view-dependent simplification for polygonal models , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[8]  Hugues Hoppe,et al.  Efficient implementation of progressive meshes , 1998, Comput. Graph..

[9]  Hugues Hoppe,et al.  View-dependent refinement of progressive meshes , 1997, SIGGRAPH.

[10]  Emo Welzl,et al.  Contour Edge Analysis for Polyhedron Projections , 1997, Geometric Modeling.

[11]  Lee Markosian,et al.  Real-time nonphotorealistic rendering , 1997, SIGGRAPH.

[12]  Leonidas J. Guibas,et al.  On incremental rendering of silhouette maps of polyhedral scene , 2000, SODA '00.

[13]  Mario Costa Sousa,et al.  The edge buffer: a data structure for easy silhouette rendering , 2000, NPAR '00.

[14]  David P. Luebke,et al.  View-dependent simplification of arbitrary polygonal environments , 1997, SIGGRAPH.

[15]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[16]  Jirí Matousek,et al.  Range searching with efficient hierarchical cuttings , 1992, SCG '92.

[17]  Raimund Seidel,et al.  Some methods of computational geometry applied to computer graphics , 1984, Comput. Vis. Graph. Image Process..

[18]  Pedro V. Sander,et al.  Silhouette clipping , 2000, SIGGRAPH.

[19]  Ramesh Raskar,et al.  Image precision silhouette edges , 1999, SI3D.

[20]  Michael T. Goodrich,et al.  Efficient perspective-accurate silhouette computation , 1999, SCG '99.

[21]  Franklin C. Crow,et al.  Shadow algorithms for computer graphics , 1977, SIGGRAPH.

[22]  Hans-Peter Seidel,et al.  A General Framework for Mesh Decimation , 1998, Graphics Interface.

[23]  Bernard Chazelle,et al.  A Functional Approach to Data Structures and Its Use in Multidimensional Searching , 1988, SIAM J. Comput..

[24]  Mihai Pop,et al.  Exploiting coherence in spatial database queries , 2000 .

[25]  Peter-Pike J. Sloan,et al.  Interactive technical illustration , 1999, SI3D.

[26]  Michael T. Goodrich,et al.  Balanced aspect ratio trees: combining the advantages of k-d trees and octrees , 1999, SODA '99.

[27]  William J. Bouma,et al.  Velocity-based Collision Detection , 1995 .

[28]  Ramesh Raskar,et al.  Image-based visual hulls , 2000, SIGGRAPH.

[29]  Micha Sharir,et al.  Applications of a new space-partitioning technique , 1993, Discret. Comput. Geom..