Progressive simplicial complexes

In this paper, we introduce the progressive simplicial complex (PSC) representation, a new format for storing and transmitting triangulated geometric models. Like the earlier progressive mesh (PM) representation, it captures a given model as a coarse base model together with a sequence of refinement transformations that progressively recover detail. The PSC representation makes use of a more general refinement transformation, allowing the given model to be an arbitrary triangulation (e.g. any dimension, non-orientable, non-manifold, non-regular), and the base model to always consist of a single vertex. Indeed, the sequence of refinement transformations encodes both the geometry and the topology of the model in a unified multiresolution framework. The PSC representation retains the advantages of PM’s. It defines a continuous sequence of approximating models for runtime level-of-detail control, allows smooth transitions between any pair of models in the sequence, supports progressive transmission, and offers a space-efficient representation. Moreover, by allowing changes to topology, the PSC sequence of approximations achieves better fidelity than the corresponding PM sequence. We develop an optimization algorithm for constructing PSC representations for graphics surface models, and demonstrate the framework on models that are both geometrically and topologically complex. CR Categories: I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling surfaces and object representations. Additional

[1]  J. Hudson Piecewise linear topology , 1966 .

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

[3]  G. Ringel,et al.  Minimal triangulations on orientable surfaces , 1980 .

[4]  Ian H. Witten,et al.  Arithmetic coding for data compression , 1987, CACM.

[5]  E. Brisson,et al.  Representation ofd-dimensional geometric objects , 1990 .

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

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

[8]  Jarek Rossignac,et al.  Multi-resolution 3D approximations for rendering complex scenes , 1993, Modeling in Computer Graphics.

[9]  Carlo H. Séquin,et al.  Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments , 1993, SIGGRAPH.

[10]  Tony DeRose,et al.  Mesh optimization , 1993, SIGGRAPH.

[11]  Carlo Cattani,et al.  Dimension-independent modeling with simplicial complexes , 1993, TOGS.

[12]  W. Stürzlinger,et al.  Generating Multiple Levels of Detail from Polygonal Geometry Models , 1995, Virtual Environments.

[13]  Michela Bertolotto,et al.  Pyramidal simplicial complexes , 1995, SMA '95.

[14]  Michael Deering,et al.  Geometry compression , 1995, SIGGRAPH.

[15]  A. Guéziec Surface simplification inside a tolerance volume , 1996 .

[16]  Rémi Ronfard,et al.  Full‐range approximation of triangulated polyhedra. , 1996, Comput. Graph. Forum.

[17]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[18]  Chandrajit L. Bajaj,et al.  Error-bounded reduction of triangle meshes with multivariate data , 1996, Electronic Imaging.

[19]  Carlos Andújar,et al.  Automatic Generation of Multiresolution Boundary Representations , 1996, Comput. Graph. Forum.

[20]  Amitabh Varshney,et al.  Controlled Topology Simplification , 1996, IEEE Trans. Vis. Comput. Graph..

[21]  Dieter Schmalstieg,et al.  Smooth levels of detail , 1997, Proceedings of IEEE 1997 Annual International Symposium on Virtual Reality.

[22]  Michael Garland,et al.  Surface simplification using quadric error metrics , 1997, SIGGRAPH.

[23]  Paul S. Heckbert,et al.  Survey of Polygonal Surface Simplification Algorithms , 1997 .

[24]  Gabriel Taubin,et al.  Geometric compression through topological surgery , 1998, TOGS.

[25]  David Luebke,et al.  Hierarchical Structures for Dynamic Polygonal Simplification , 1999 .

[26]  R. Ho Algebraic Topology , 2022 .