Sciweavers

1422 search results - page 152 / 285
» Hierarchical Spatial Data Structures
Sort
View
ISVC
2007
Springer
14 years 2 months ago
An Anti-aliasing Technique for Voxel-Based Massive Model Visualization Strategies
CAD models of industrial installations usually have hundreds of millions of triangles. For this reason they cannot be interactively rendered in the current generation of computer h...
Gustavo N. Wagner, Alberto Raposo, Marcelo Gattass
DATESO
2009
158views Database» more  DATESO 2009»
13 years 5 months ago
Benchmarking Coding Algorithms for the R-tree Compression
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications i...
Jirí Walder, Michal Krátký, R...
VMV
2003
163views Visualization» more  VMV 2003»
13 years 9 months ago
Real-Time Volumetric Intersections of Deforming Objects
We present a new algorithm for the computation of volumetric intersections of geometrically complex objects, which can be used for the efficient detection of collisions. Our appr...
Bruno Heidelberger, Matthias Teschner, Markus H. G...
IJCV
2008
172views more  IJCV 2008»
13 years 7 months ago
Nonparametric Bayesian Image Segmentation
Image segmentation algorithms partition the set of pixels of an image into a specific number of different, spatially homogeneous groups. We propose a nonparametric Bayesian model f...
Peter Orbanz, Joachim M. Buhmann
CORR
1999
Springer
222views Education» more  CORR 1999»
13 years 7 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount