Sciweavers

9 search results - page 2 / 2
» SOT: compact representation for tetrahedral meshes
Sort
View
COMPGEOM
2006
ACM
13 years 11 months ago
Engineering a compact parallel delaunay algorithm in 3D
We describe an implementation of a compact parallel algorithm for 3D Delaunay tetrahedralization on a 64-processor shared-memory machine. Our algorithm uses a concurrent version o...
Daniel K. Blandford, Guy E. Blelloch, Clemens Kado...
JGTOOLS
2006
125views more  JGTOOLS 2006»
13 years 4 months ago
GPU-Based Tiled Ray Casting Using Depth Peeling
We propose a new hardware ray casting algorithm for unstructured meshes composed of tetrahedral cells. Our work builds on the technique published at IEEE Visualization 2003 by Wei...
Fábio F. Bernardon, Christian Azambuja Pago...
TVCG
2010
198views more  TVCG 2010»
12 years 11 months ago
Isodiamond Hierarchies: An Efficient Multiresolution Representation for Isosurfaces and Interval Volumes
Efficient multiresolution representations for isosurfaces and interval volumes are becoming increasingly important as the gap between volume data sizes and processing speed continu...
Kenneth Weiss, Leila De Floriani
VIS
2009
IEEE
246views Visualization» more  VIS 2009»
14 years 6 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