Sciweavers

Share
COMGEO
1999
ACM
9 years 9 months ago
Multiresolution hierarchies on unstructured triangle meshes
The use of polygonal meshes for the representation of highly complex geometric objects has become the de facto standard in most computer graphics applications. Especially triangle...
Leif Kobbelt, Jens Vorsatz, Hans-Peter Seidel
CAD
2000
Springer
9 years 9 months ago
Efficiently computing and updating triangle strips for real-time rendering
Triangle strips are a widely used hardware-supported data-structure to compactly represent and efficiently render polygonal meshes. In this paper we survey the efficient generatio...
Jihad El-Sana, Francine Evans, Aravind Kalaiah, Am...
CGF
2004
127views more  CGF 2004»
9 years 9 months ago
Approximated Centroidal Voronoi Diagrams for Uniform Polygonal Mesh Coarsening
We present a novel clustering algorithm for polygonal meshes which approximates a Centroidal Voronoi Diagram construction. The clustering provides an efficient way to construct un...
Sébastien Valette, Jean-Marc Chassery
CAD
2004
Springer
9 years 9 months ago
Teaching meshes, subdivision and multiresolution techniques
In recent years, geometry processing algorithms that directly operate on polygonal meshes have become an indispensable tool in computer graphics, CAD/CAM applications, numerical s...
Stephan Bischoff, Leif Kobbelt
CAGD
2005
130views more  CAGD 2005»
9 years 9 months ago
Truly selective polygonal mesh hierarchies with error control
In this work a new multi-resolution model is proposed for polygonal meshes. It is based on the dual edge collapse, which performs face clustering instead of vertex clustering. The...
Stefan Gumhold
CGF
2008
100views more  CGF 2008»
9 years 9 months ago
Distortion-Free Steganography for Polygonal Meshes
We present a technique for steganography in polygonal meshes. Our method hides a message in the indexed representation of a mesh by permuting the order in which faces and vertices...
Alexander Bogomjakov, Craig Gotsman, Martin Isenbu...
CGF
2010
120views more  CGF 2010»
9 years 9 months ago
Polygonal mesh watermarking using Laplacian coordinates
We propose a watermarking algorithm for polygonal meshes based on the modification of the Laplacian coordinates. More specifically, we first compute the Laplacian coordinates (x,y...
Ying Yang, Ioannis P. Ivrissimtzis
VMV
2000
116views Visualization» more  VMV 2000»
9 years 10 months ago
Quadrilateral Remeshing
The use of polygonal meshes, especially triangle meshes, is manifold but a lot of algorithms require the mesh to be structured in a certain way and cannot be applied to an arbitra...
Kai Hormann, Günther Greiner
GRAPHICSINTERFACE
2001
9 years 10 months ago
Realistic and Controllable Fire Simulation
We introduce a set of techniques that are used together to produce realistic-looking animations of burning objects. These include a new method for simulating spreading on polygona...
Philippe Beaudoin, Sébastien Paquet, Pierre...
CCCG
2003
9 years 10 months ago
Encoding Quadrilateral Meshes
An important problem in geometric compression is to find succinct representations (encoding schemes) for the conectivity of polygonal meshes. In this note, we show that the encod...
Asish Mukhopadhyay, Quanbin Jing
books