Sciweavers

1261 search results - page 189 / 253
» Approximation algorithms for aligning points
Sort
View
GIS
2002
ACM
14 years 9 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...
VISUALIZATION
1998
IEEE
15 years 2 months ago
Eliminating popping artifacts in sheet buffer-based splatting
Splatting is a fast volume rendering algorithm which achieves its speed by projecting voxels in the form of pre-integrated interpolation kernels, or splats. Presently, two main va...
Klaus Mueller, Roger Crawfis
COMPGEOM
2011
ACM
14 years 1 months ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
14 years 11 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
CVPR
2003
IEEE
15 years 11 months ago
Shape-From-Silhouette of Articulated Objects and its Use for Human Body Kinematics Estimation and Motion Capture
Shape-From-Silhouette (SFS), also known as Visual Hull (VH) construction, is a popular 3D reconstruction method which estimates the shape of an object from multiple silhouette ima...
German K. M. Cheung, Simon Baker, Takeo Kanade