Results 1 - 10 of 94

Fast Multiresolution Mesh Decompression

by Renato Pajarola Jarek Rossignac, Renato Pajarola, Renato Pajarola, Jarek Rossignac, Jarek Rossignac , 1999
"... Compression techniques for triangle-mesh representations of 3D models have been the focus of many recent efforts from the graphics, modeling, and theory research community; from developers of computer graphics hardware and software; and from organizations that define international standards. An i ..."
Abstract - Add to MetaCart
or software implementations. Because these three objectives impose contradictory constraints on the compressed format, previously reported efforts focus primarily on one -- sometimes two -- of these objectives. The SQUEEZE technique introduced here for Fast and Progressive Decompression of Triangle Meshes

Interactive Multi-Resolution Modeling on Arbitrary Meshes

by Leif Kobbelt , Swen Campagna, Jens Vorsatz, Hans-Peter Seidel , 1998
"... During the last years the concept of multi-resolution modeling has gained special attention in many fields of computer graphics and geometric modeling. In this paper we generalize powerful multiresolution techniques to arbitrary triangle meshes without requiring subdivision connectivity. Our major o ..."
Abstract - Cited by 307 (34 self) - Add to MetaCart
coefficients already provides effective and efficient algorithms to extract multi-resolution information from unstructured meshes. In combination with discrete fairing techniques, i.e., the constrained minimization of discrete energy functionals, we obtain very fast mesh smoothing algorithms which are able

MAPS: Multiresolution Adaptive Parameterization of Surfaces

by Aaron W. F. Lee, Wim Sweldens, Peter Schröder, Lawrence Cowsar, David Dobkin , 1998
"... We construct smooth parameterizations of irregular connectivity triangulations of arbitrary genus 2-manifolds. Our algorithm uses hierarchical simplification to efficiently induce a parameterization of the original mesh over a base domain consisting of a small number of triangles. This initial param ..."
Abstract - Cited by 265 (12 self) - Add to MetaCart
We construct smooth parameterizations of irregular connectivity triangulations of arbitrary genus 2-manifolds. Our algorithm uses hierarchical simplification to efficiently induce a parameterization of the original mesh over a base domain consisting of a small number of triangles. This initial

Fast Multiresolution Surface Meshing

by M. H. Gross, R. Gatti, O. Staadt - IEEE Visualization , 1995
"... We present a new method for adaptive surface meshing and triangulation which controls the local level–of–detail of the surface approximation by local spectral estimates. These estimates are de-termined by a wavelet representation of the surface data. The basic idea is to decompose the initial data s ..."
Abstract - Cited by 77 (3 self) - Add to MetaCart
We present a new method for adaptive surface meshing and triangulation which controls the local level–of–detail of the surface approximation by local spectral estimates. These estimates are de-termined by a wavelet representation of the surface data. The basic idea is to decompose the initial data

Interpolating Subdivision for Meshes with Arbitrary Topology

by Denis Zorin, Peter Schröder, Wim Sweldens
"... Subdivision is a powerful paradigm for the generation of surfaces of arbitrary topology. Given an initial triangular mesh the goal is to produce a smooth and visually pleasing surface whose shape is controlled by the initial mesh. Of particular interest are interpolating schemes since they match the ..."
Abstract - Cited by 236 (24 self) - Add to MetaCart
the original data exactly, and play an important role in fast multiresolution and wavelet techniques. Dyn, Gregory, and Levin introduced the Butterfly scheme, which yields C 1 surfaces in the topologically regular setting. Unfortunately it exhibits undesirable artifacts in the case of an irregular topology. We

Real time compression of triangle mesh connectivity

by Stefan Gumhold, Wolfgang Straßer - SIGGRAPH 98 Conference Proceedings, Annual Conference Series , 1998
"... In this paper we introduce a new compressed representation for the connectivity of a triangle mesh. We present local compression and decompression algorithms which are fast enough for real time applications. The achieved space compression rates keep pace with the best rates reported for any known gl ..."
Abstract - Cited by 198 (11 self) - Add to MetaCart
In this paper we introduce a new compressed representation for the connectivity of a triangle mesh. We present local compression and decompression algorithms which are fast enough for real time applications. The achieved space compression rates keep pace with the best rates reported for any known

Squeeze: Fast and progressive decompression of triangle meshes

by Renato Pajarola, Jarek Rossignac, See Profile, Renato Pajarola, Jarek Rossignac - In Proceedings Computer Graphics International CGI 2000 , 2000
"... All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract - Cited by 24 (7 self) - Add to MetaCart
All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.

Multiresolution random accessible mesh compression

by Junho Kim, Sungyul Choe, Seungyong Lee - Computer Graphics Forum
"... This paper presents a novel approach for mesh compression, which we call multiresolution random accessible mesh compression. In contrast to previous mesh compression techniques, the approach enables us to progressively decompress an arbitrary portion of a mesh without decoding other non-interesting ..."
Abstract - Cited by 8 (1 self) - Add to MetaCart
This paper presents a novel approach for mesh compression, which we call multiresolution random accessible mesh compression. In contrast to previous mesh compression techniques, the approach enables us to progressively decompress an arbitrary portion of a mesh without decoding other non

SQUEEZE: Fast and Progressive Decompression of Triangle Meshes

by Renato Pajarola Jarek, Jarek Rossignac - in Proceedings of Computer Graphics International Conference, 2000 , 2000
"... An ideal triangle mesh compression technology would simultaneously support the following three objectives: (1) progressive refinements of the received mesh during decompression, (2) nearly optimal compression ratios for both geometry and connectivity, and (3) in-line, real-time decompression algorit ..."
Abstract - Add to MetaCart
An ideal triangle mesh compression technology would simultaneously support the following three objectives: (1) progressive refinements of the received mesh during decompression, (2) nearly optimal compression ratios for both geometry and connectivity, and (3) in-line, real-time decompression

Interactive Multiresolution Editing of Arbitrary Meshes

by Seungyong Lee - Computer Graphics Forum , 1999
"... This paper presents a novel approach to multiresolution editing of a triangular mesh. The basic idea is to embed an editing area of a mesh onto a 2D rectangle and interpolate the user-specified editing information over the 2D rectangle. The result of the interpolation is mapped back to the editing ..."
Abstract - Cited by 12 (0 self) - Add to MetaCart
This paper presents a novel approach to multiresolution editing of a triangular mesh. The basic idea is to embed an editing area of a mesh onto a 2D rectangle and interpolate the user-specified editing information over the 2D rectangle. The result of the interpolation is mapped back
Results 1 - 10 of 94