Sciweavers

65 search results - page 2 / 13
» Mesh Graph Structure for Longest-Edge Refinement Algorithms
Sort
View
TVCG
2010
198views more  TVCG 2010»
12 years 12 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
CGF
2008
217views more  CGF 2008»
13 years 5 months ago
A Flexible Kernel for Adaptive Mesh Refinement on GPU
We present a flexible GPU kernel for adaptive on-the-fly refinement of meshes with arbitrary topology. By simply reserving a small amount of GPU memory to store a set of adaptive ...
Tamy Boubekeur, Christophe Schlick
CGF
2010
153views more  CGF 2010»
13 years 5 months ago
Localized Delaunay Refinement for Sampling and Meshing
The technique of Delaunay refinement has been recognized as a versatile tool to generate Delaunay meshes of a variety of geometries. Despite its usefulness, it suffers from one la...
Tamal K. Dey, Joshua A. Levine, A. Slatton
SIGGRAPH
1997
ACM
13 years 8 months ago
View-dependent refinement of progressive meshes
Level-of-detail (LOD) representations are an important tool for realtime rendering of complex geometric environments. The previously introduced progressive mesh representation def...
Hugues Hoppe
BPM
2008
Springer
155views Business» more  BPM 2008»
13 years 7 months ago
The Refined Process Structure Tree
Abstract. We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a ...
Jussi Vanhatalo, Hagen Völzer, Jana Koehler