Sciweavers

7 search results - page 1 / 2
» Efficient traversal of mesh edges using adjacency primitives
Sort
View
TOG
2008
137views more  TOG 2008»
13 years 7 months ago
Efficient traversal of mesh edges using adjacency primitives
Processing of mesh edges lies at the core of many advanced realtime rendering techniques, ranging from shadow and silhouette computations, to motion blur and fur rendering. We pre...
Pedro V. Sander, Diego Nehab, Eden Chlamtac, Hugue...
VIS
2009
IEEE
246views Visualization» more  VIS 2009»
14 years 8 months ago
Supercubes: A High-Level Primitive for Diamond Hierarchies
Abstract-- Volumetric datasets are often modeled using a multiresolution approach based on a nested decomposition of the domain into a polyhedral mesh. Nested tetrahedral meshes ge...
Kenneth Weiss, Leila De Floriani
ICPR
2002
IEEE
14 years 15 days ago
A New Mesh Simplification Algorithm Combining Half-Edge Data Structure with Modified Quadric Error Metric
This paper presents a fast mesh simplification algorithm that combined the half-edge data structure with modified quadric error metric (QEM). When half-edge structure is used, the...
Guangming Li, Jie Tian, Mingchang Zhao, Huiguang H...
SMA
2009
ACM
105views Solid Modeling» more  SMA 2009»
14 years 2 months ago
SOT: compact representation for tetrahedral meshes
The Corner Table (CT) promoted by Rossignac et al. provides a simple and efficient representation of triangle meshes, storing 6 integer references per triangle (3 vertex reference...
Topraj Gurung, Jarek Rossignac
SIGGRAPH
2010
ACM
13 years 11 months ago
Star-contours for efficient hierarchical self-collision detection
Collision detection is a problem that has often been addressed efficiently with the use of hierarchical culling data structures. In the subproblem of self-collision detection for ...
Sara C. Schvartzman, Álvaro G. Pérez, Miguel A. ...