Results 1 to 10 of about 38,901 (314)
Static 3D Triangle Mesh Compression Overview [PDF]
3D triangle meshes are extremely used to model discrete surfaces, and almost always represented with two tables: one for geometry and another for connectivity.
Avilés Rodrigálvarez, Marcos+1 more
core +4 more sources
Vector field processing on triangle meshes [PDF]
While scalar fields on surfaces have been staples of geometry processing, the use of tangent vector fields has steadily grown in geometry processing over the last two decades: they are crucial to encoding directions and sizing on surfaces as commonly ...
Desbrun M.+4 more
core +9 more sources
Repairing triangle meshes built from scanned point cloud [PDF]
The Reverse Engineering process consists of a succession of operations that aim at creating a digital representation of a physical model. The reconstructed geometric model is often a triangle mesh built from a point cloud acquired with a scanner ...
MORARU, George+2 more
core +7 more sources
Decimation of triangle meshes [PDF]
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. However, because the polygon is linear, often thousands or millions of primitives are required to capture the details of complex ...
Jonathan A. Zarge+2 more
openaire +2 more sources
Constructing hierarchies for triangle meshes [PDF]
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 M/sub 0/, M/sub 1/, M/sub 2/..., M/sub n/, where each mesh M/sub i/ can be transformed to mesh M/sub i+1/ through a set of triangle-collapse operations.
Gieng, Tran S.+4 more
openaire +3 more sources
Developability of triangle meshes [PDF]
Developable surfaces are those that can be made by smoothly bending flat pieces without stretching or shearing. We introduce a definition of developability for triangle meshes which exactly captures two key properties of smooth developable surfaces, namely flattenability and presence of straight ruling lines.
Oded Stein, Eitan Grinspun, Keenan Crane
openaire +1 more source
On the interpolation of normal vectors for triangle meshes [PDF]
SUMMARYThis paper analyzes the problem arising from the need to assign information about the normal vectors to the surface at the nodes of a mesh of triangles. Meshes of triangles do not have normals uniquely defined at the nodes. A widely used technique to compute the normal direction at any given node is to compute the weighted average of the normals
Ubach de Fuentes, Pere-Andreu+2 more
openaire +5 more sources
Random-Accessible Compressed Triangle Meshes [PDF]
With the exponential growth in size of geometric data, it is becoming increasingly important to make effective use of multilevel caches, limited disk storage, and bandwidth. As a result, recent work in the visualization community has focused either on designing sequential access compression schemes or on producing cache-coherent layouts of ...
Yoon, Sung-Eui, Lindstrom, Peter
openaire +4 more sources
Conformal equivalence of triangle meshes
We present a new algorithm for conformal mesh parameterization. It is based on a precise notion of discrete conformal equivalence for triangle meshes which mimics the notion of conformal equivalence for smooth surfaces.
Springborn, Boris+2 more
openaire +5 more sources
There are simple and robust refinements (almost) as good as Delaunay [PDF]
A new edge-based partition for triangle meshes is presented, the Seven Triangle Quasi-Delaunay partition (7T-QD). The proposed partition joins together ideas of the Seven Triangle Longest-Edge partition (7T-LE), and the classical criteria for ...
Moreno González, Auxiliadora+3 more
core +1 more source