COMGEO
1999
ACM
13 years 4 months ago
1999
ACM
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...
CAD
2000
Springer
13 years 4 months ago
2000
Springer
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...
CGF
2004
13 years 4 months ago
2004
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...
CAD
2004
Springer
13 years 4 months ago
2004
Springer
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...
CAGD
2005
13 years 4 months ago
2005
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...
CGF
2008
13 years 4 months ago
2008
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...
CGF
2010
13 years 4 months ago
2010
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...
VMV
2000
13 years 6 months ago
2000
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...
GRAPHICSINTERFACE
2001
13 years 6 months ago
2001
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...
CCCG
2003
13 years 6 months ago
2003
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...