André Guéziec
Gabriel Taubin
- 1.R. Ronfard and J. Rossignac. Full-range approximation of triangulated polyhedra. Computer Graphics Forum, 15(3):C67- C76, 1996. Proe. Eurographics'96.Google Scholar
Cross Ref
- 2.A. Gu6ziec. Surface simplification with variable tolerance. In SecondAnnual International Symposium on Medical Robotics and Computer Assisted Surgery, pages 132-I 39, Baltimore, MD, November 1995.Google Scholar
- 3.H. Hoppe. Progressive meshes, in Siggraph, pages 99-108, New Orleans, August 1996. ACM. Google ScholarDigital Library
- 4.J.C. Xia and A. Varshney. Dynamic view-dependent simplification for polygonal models. In Yagel and Nielson, editors, Irtsualization 96, pages 327-334. IEEE, October 1996. Google ScholarDigital Library
- 5.R Lindstrom, D. Koller, W. Ribarsky, L.E Hodges, N. Faust, and G.A. Turner. Real-time, continuous level of detail rendering of height fields. In Siggraph, pages 109-118, New Orleans, August 1996. ACM. Google ScholarDigital Library
- 6.D. Luebke and C. Edkson. View dependent simplification of arbitrary polygonal environments. In Siggraph, pages 199- 208, Los Angeles, August 1997. ACM. Google ScholarDigital Library
- 7.L. De Florianio E Magillo, and E. Puppo. Building and traversing a surface at variable resolution. In Visualization 97, pages 103-I 10. IEEE, 1997. Google ScholarDigital Library
- 8.C.M. Hoffmann. Geometric and Solid Modeling: An Introduction. Morgan Kaufmann, San Mateo, California, 1989. Google ScholarDigital Library
- 9.H. Hoppe. View dependent refinement ofprogressive meshes. in Siggraph, pages 189-I 98, Los Angeles, August 1997. Google ScholarDigital Library
- 10.R.E. Tarjan. Data StructuresandNetworkAIgorithms. Number44 in CBMS-NSF Regional Conference Series in Applied Mathematics. SIAM, 1983. Google ScholarDigital Library
- 11.M. K. Agoston. Algebraic Topology.A First Course. Pure and Applied Mathematics. Marcel Dekker, Inc., New York, 1976.Google Scholar
- 12.L. De Floriani, B. Falcidieno, and (2. Pienovi. Delaunay-based representation of surfaces defined over arbitrarily shaped domains. CVGIP, 32:127-140, 1985.Google Scholar
- 13.C. Bajaj and D. Schikore. Error-bounded reduction of triangle meshes with multivariate data. volume 2656, pages 34-45. SPIE, 1996.Google Scholar
- 14.J. Cohen, D. Manoeha, and M. Olano. Simplifying polygonal models using successive mappings. In IEEE V'tsualization, pages 395-402, 1997. Google ScholarDigital Library
Index Terms
- Simplicial maps for progressive transmission of polygonal surfaces
Recommendations
Progressive lossless compression of arbitrary simplicial complexes
SIGGRAPH '02: Proceedings of the 29th annual conference on Computer graphics and interactive techniquesEfficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are manifold or "nearly manifold". We propose here a progressive geometry compression ...
Using Most Isometric Parametrizations for Remeshing Polygonal Surfaces
GMP '00: Proceedings of the Geometric Modeling and Processing 2000The importance of triangle meshes with a special kind of connectivity, the so-called subdivision connectivity is still growing. Therefore it is important to develop efficient algorithms for converting a given mesh with arbitrary connectivity into one ...
Progressive lossless compression of arbitrary simplicial complexes
Efficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are manifold or "nearly manifold". We propose here a progressive geometry compression ...
Comments