• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Progressive Simplicial Complexes (1997)

Cached

  • Download as a PDF

Download Links

  • [research.microsoft.com]
  • [www.ri.cmu.edu]
  • [www.research.microsoft.com]
  • [research.microsoft.com]
  • [research.microsoft.com]
  • [hhoppe.com]
  • [www.cs.cmu.edu]
  • [graphics.lcs.mit.edu]
  • [groups.csail.mit.edu]
  • [people.csail.mit.edu]
  • [graphics.csail.mit.edu]
  • [ftp.cs.cmu.edu]
  • [www.research.microsoft.com]
  • [www.cs.berkeley.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Jovan Popovic , Hugues Hoppe
Citations:145 - 2 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Popovic97progressivesimplicial,
    author = {Jovan Popovic and Hugues Hoppe},
    title = {Progressive Simplicial Complexes},
    year = {1997}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

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.

Citations

985 Progressive meshes - Hoppe - 1996
818 Surface simplification using quadric error metrics - Garland, Heckbert - 1997
613 Algebraic topology - Spanier - 1981
584 Artihmetic coding for data compression - Witten, Neal, et al. - 1987
518 Decimation of Triangle Meshes - Schroeder, Zarge, et al.
372 Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments - FUNKHOUSER, SEQUIN - 1993
358 Re-Tiling Polygonal Surfaces - Turk
288 Geometry Compression - Deering - 1995
286 Multi-resolution 3D approximations for rendering complex scenes - Rossignac, Borrel - 1059
275 Hierarchical geometric models for visible surface algorithms - Clark - 1976
177 Survey of polygonal surface simplification algorithms - Heckbert, Garland - 1997
125 J.Rossignac, Full-range approximation of triangulated polyhedra - Ronfard - 1996
74 The radial edge structure: A topological representation for non-manifold geometric boundary modeling - WEILER - 1988
68 Controlled topology simplification - He, Hong, et al. - 1996
51 Error bounded reduction of triangle meshes with multivariate data - BAJAJ, SCHIKORE - 1996
43 Piecewise Linear Topology - Hudson - 1969
37 Surface Simplification Inside a Tolerance Volume - GUÉZIEC - 1995
34 Dimension-independent modeling with simplicial complexes - Paoluzzi, Bernardini, et al. - 1993
33 Geometry compression through topological surgery - Taubin, Rossignac - 1998
27 Minimal triangulations of orientable surfaces - Jungerman, Ringel - 1980
20 Generating multiple levels of detail from polygonal geometry models - Schaufler, Sturzlinger - 1995
17 Smooth Levels of Detail - Schmalstieg, Schaufler - 1997
16 Hierarchical structures for dynamic polygonal simplification - Luebke - 1996
15 Pyramidal simplicial complexes - Bertolotto, Floriani, et al.
14 Automatic generation of multiresolution boundary representations - Andujar, Ayala, et al. - 1996
13 H.: Arithmetic coding for data compression - CLEARY, NEAL, et al. - 1987
6 Representation of d-dimensional geometric objects - Brisson� - 1990
4 Multiresolution Representation of Volume Data through Herarchical Simplicial Complexes - Bertolotto, Bruzzone, et al. - 1994
3 Decimation of triangle meshes - unknown authors - 1992
2 Surface simplification inside a tolerance volume - eziec, A - 1996
2 Geometric modeling with simplicial sets - Lang�, Lienhardt� - 1995
1 Automatic generation of multiresolution boundary representations - �, Sol�e� - 1996
1 Multiresolution representation of volume data through hierarchical simplicial complexes. In Aspects of visual form processing - �, Puppo� - 1994
1 Pyramidal simplicial complexes - �, Marzano� - 1995
1 Controlled topology simplification - �, Wang� - 1996
1 Dimension-independent modeling with simplicial complexes - �, Ferrucci� - 1993
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University