Multi-resolution 3D approximations for rendering complex scenes

We present a simple, effective, and efficient technique for approximating arbitrary polyhedra. It is based on triangulation and vertex-clustering, and produces a series of 3D approximations (also called “levels of detail”) that resemble the original object from all viewpoints, but contain an increasingly smaller number of faces and vertices. The simplification is more efficient than competing techniques because it does not require building and maintaining a topological adjacency graph. Furthermore, it is better suited for mechanical CAD models which often exhibit patterns of small features, because it automatically groups and simplifies features that are geometrically close, but need not be topologically close or even part of a single connected component Using a lower level of detail when displaying small, distant, or background objects improves graphic performance without a significant loss of perceptual information, and thus enables realtime inspection of complex scenes or a convenient environment for animation or walkthrough preview.

[1]  James H. Clark,et al.  Hierarchical geometric models for visible surface algorithms , 1976, CACM.

[2]  Franklin C. Crow,et al.  A more flexible image generation environment , 1982, SIGGRAPH.

[3]  Lance Williams,et al.  Pyramidal parametrics , 1983, SIGGRAPH.

[4]  Francis J. M. Schmitt,et al.  An adaptive subdivision method for surface-fitting from sampled data , 1986, SIGGRAPH.

[5]  Robert B McMaster,et al.  Automated Line Generalization , 1987 .

[6]  Alyn P. Rockwood,et al.  Real-time rendering of trimmed surfaces , 1989, SIGGRAPH.

[7]  Leonard A. Ferrari,et al.  Curves and Surfaces in Computer Vision and Graphics , 1990 .

[8]  Frederick P. Brooks,et al.  Towards image realism with interactive update rates in complex virtual building environments , 1990, I3D '90.

[9]  Tiow Seng Tan,et al.  An O(n2log n) time algorithm for the MinMax angle triangulation , 1990, SCG '90.

[10]  Y. Kim Convex decomposition and solid geometric modeling , 1990 .

[11]  Carlo H. Séquin,et al.  Visibility preprocessing for interactive walkthroughs , 1991, SIGGRAPH.

[12]  Michael Zyda,et al.  Simplification of objects rendered by polygonal approximations , 1991, Comput. Graph..

[13]  Marilyn E. Noz,et al.  Constructing topologically connected surfaces for the comprehensive analysis of 3-D medical structures , 1991, Medical Imaging.

[14]  Tony DeRose,et al.  Surface reconstruction from unorganized points , 1992, SIGGRAPH.

[15]  William E. Lorensen,et al.  Decimation of triangle meshes , 1992, SIGGRAPH.

[16]  Jarek Rossignac,et al.  Solid-interpolating deformations: Construction and animation of PIPs , 1991, Comput. Graph..

[17]  Hugues Hoppe,et al.  Fitting of surfaces to scattered data , 1992 .

[18]  Greg Turk,et al.  Re-tiling polygonal surfaces , 1992, SIGGRAPH.

[19]  Theodosios Pavlidis,et al.  Hierarchical triangulation using cartographic coherence , 1992, CVGIP Graph. Model. Image Process..