Sciweavers

337 search results - page 6 / 68
» A Cache-Aware Algorithm for PDEs on Hierarchical Data Struct...
Sort
View
CGF
1998
134views more  CGF 1998»
15 years 2 months ago
Progressive Iso-Surface Extraction from Hierarchical 3D Meshes
A multiresolution data decomposition offers a fundamental framework supporting compression, progressive transmission, and level-of-detail (LOD) control for large two or three dime...
Wenli Cai, Georgios Sakas, Roberto Grosso, Thomas ...
TOG
2012
199views Communications» more  TOG 2012»
13 years 5 months ago
Tracking surfaces with evolving topology
We present a method for recovering a temporally coherent, deforming triangle mesh with arbitrarily changing topology from an incoherent sequence of static closed surfaces. We solv...
Morten Bojsen-Hansen, Hao Li, Chris Wojtan
ICCS
2007
Springer
15 years 6 months ago
Discovering Latent Structures: Experience with the CoIL Challenge 2000 Data Set
We present a case study to demonstrate the possibility of discovering complex and interesting latent structures using hierarchical latent class (HLC) models. A similar effort was m...
Nevin Lianwen Zhang
COMPGEOM
2005
ACM
15 years 5 months ago
The skip quadtree: a simple dynamic data structure for multidimensional data
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
David Eppstein, Michael T. Goodrich, Jonathan Z. S...
SSD
1995
Springer
97views Database» more  SSD 1995»
15 years 6 months ago
Ranking in Spatial Databases
Abstract. An algorithm for ranking spatial objects according to increasing distance from a query object is introduced and analyzed. The algorithm makes use of a hierarchical spatia...
Gísli R. Hjaltason, Hanan Samet