Results 1  10
of
64,588
Decimation of triangle meshes
 Computer Graphics (SIGGRAPH '92 Proceedings
, 1992
"... The polygon remains a popular graphics primitive for computer graphics application. Besides having a simple representation, computer rendering of polygons is widely supported by commercial graphics hardware and software. ..."
Abstract

Cited by 641 (2 self)
 Add to MetaCart
The polygon remains a popular graphics primitive for computer graphics application. Besides having a simple representation, computer rendering of polygons is widely supported by commercial graphics hardware and software.
Edgebreaker: Connectivity compression for triangle meshes
 IEEE Transactions on Visualization and Computer Graphics
, 1999
"... Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called connectivity or topology) of threedimensional triangle meshes. Edgebreaker improves upon the worst case storage required by previously reported schemes, most of which require O(nlogn) bits to store ..."
Abstract

Cited by 298 (24 self)
 Add to MetaCart
Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called connectivity or topology) of threedimensional triangle meshes. Edgebreaker improves upon the worst case storage required by previously reported schemes, most of which require O(nlogn) bits
Constructing hierarchies for triangle meshes
 IEEE Transactions on Visualization and Computer Graphics
, 1998
"... Abstract—We present a method to produce a hierarchy of triangle meshes that can be used to blend different levels of detail in a smooth fashion. The algorithm produces a sequence of meshes 00, 01, 02,..., 0n, where each mesh 0i can be transformed to mesh 0i+1 through a set of trianglecollapse opera ..."
Abstract

Cited by 31 (7 self)
 Add to MetaCart
Abstract—We present a method to produce a hierarchy of triangle meshes that can be used to blend different levels of detail in a smooth fashion. The algorithm produces a sequence of meshes 00, 01, 02,..., 0n, where each mesh 0i can be transformed to mesh 0i+1 through a set of triangle
Snakes on triangle meshes
 In Bildverarbeitung für die Medizin
, 2005
"... Abstract. In this work we introduce a new method for representing and evolving snakes that are constrained to lie on a prescribed surface (triangle mesh). The new representation allows to automatically adapt the snake resolution to the surface tesselation and does not need any (unstable) backprojec ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Abstract. In this work we introduce a new method for representing and evolving snakes that are constrained to lie on a prescribed surface (triangle mesh). The new representation allows to automatically adapt the snake resolution to the surface tesselation and does not need any (unstable) back
Segmenting reliefs on triangle meshes
 Proc. ACM Symp. Solid and Physical Modeling
, 2006
"... Sculptural reliefs are widely used in various industries for purposes such as applying brands to packaging and decorating porcelain. In order to easily apply reliefs to CAD models, it is often desirable to reverseengineer previously designed and manufactured reliefs. 3D scanners can generate triang ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
triangle meshes from objects with reliefs; however, previous mesh segmentation work has not considered the particular problem of separation of reliefs from background. We consider here the specific case of segmenting a simple relief delimited by a single outer contour, which lies on a smooth, slowly
Estimating Curvatures and Their Derivatives on Triangle Meshes
, 2004
"... The computation of curvature and other differential properties of surfaces is essential for many techniques in analysis and rendering. We present a finitedifferences approach for estimating curvatures on irregular triangle meshes that may be thought of as an extension of a common method for estimat ..."
Abstract

Cited by 117 (1 self)
 Add to MetaCart
The computation of curvature and other differential properties of surfaces is essential for many techniques in analysis and rendering. We present a finitedifferences approach for estimating curvatures on irregular triangle meshes that may be thought of as an extension of a common method
An FPGA Implementation of Triangle Mesh Decompression
 In Proceedings of the IEEE International Symposium on Field Programmable Custom Computing Machines
, 2002
"... This paper presents an FPGAbased design and implementation of a three dimensional (3D) triangle mesh decompressor. Triangle mesh is the dominant representation of 3D geometric models. The prototype decompressor is based on a simple and highly efficient triangle mesh compression algorithm, called BF ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
This paper presents an FPGAbased design and implementation of a three dimensional (3D) triangle mesh decompressor. Triangle mesh is the dominant representation of 3D geometric models. The prototype decompressor is based on a simple and highly efficient triangle mesh compression algorithm, called
Real time compression of triangle mesh connectivity
 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
Streaming Compression of Triangle Meshes
, 2005
"... Current mesh compression schemes encode triangles and vertices in an order derived from systematically traversing the connectivity graph. These schemes struggle with gigabytesized mesh input where the construction and the usage of the data structures that support topological traversal queries becom ..."
Abstract

Cited by 21 (9 self)
 Add to MetaCart
Current mesh compression schemes encode triangles and vertices in an order derived from systematically traversing the connectivity graph. These schemes struggle with gigabytesized mesh input where the construction and the usage of the data structures that support topological traversal queries
Compressing Multiresolution Triangle Meshes
 Lecture Notes in Computer Science
, 2001
"... In this paper, we consider trianglebased twodimensional multiresolution complexes, called MultiTriangulations (MTs), constructed based on a vertexremoval simplification strategy, which is the most common strategy used to build simplified representations of surfaces, e.g., terrains. We describe a ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
In this paper, we consider trianglebased twodimensional multiresolution complexes, called MultiTriangulations (MTs), constructed based on a vertexremoval simplification strategy, which is the most common strategy used to build simplified representations of surfaces, e.g., terrains. We describe
Results 1  10
of
64,588