Sciweavers

33 search results - page 1 / 7
» An Efficient Query Structure for Mesh Refinement
Sort
View
90
Voted
CCCG
2008
14 years 11 months ago
An Efficient Query Structure for Mesh Refinement
We are interested in the following mesh refinement problem: given an input set of points P in Rd , we would like to produce a good-quality triangulation by adding new points in P....
Benoît Hudson, Duru Türkoglu
CAD
2004
Springer
14 years 10 months ago
A multi-resolution topological representation for non-manifold meshes
We address the problem of representing and processing 3D objects, described through simplicial meshes, which consist of parts of mixed dimensions, and with a non-manifold topology...
Leila De Floriani, Paola Magillo, Enrico Puppo, Da...
95
Voted
IMR
1998
Springer
15 years 2 months ago
Mesh Graph Structure for Longest-Edge Refinement Algorithms
In this paper we introduce and discuss a graph structure associated with longest-edge algorithms (algorithms based on the bisection of triangles by the longest-edge) which can be u...
Angel Plaza, José P. Suárez, Miguel ...
104
Voted
SIGGRAPH
1997
ACM
15 years 1 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
154
Voted
SIGMOD
2006
ACM
149views Database» more  SIGMOD 2006»
15 years 10 months ago
Efficient query processing on unstructured tetrahedral meshes
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
Stratos Papadomanolakis, Anastassia Ailamaki, Juli...