Sciweavers

179 search results - page 13 / 36
» On Approximating the Average Distance Between Points
Sort
View
GMP
2006
IEEE
155views Solid Modeling» more  GMP 2006»
15 years 5 months ago
Geometric Accuracy Analysis for Discrete Surface Approximation
In geometric modeling and processing, computer graphics and computer vision, smooth surfaces are approximated by discrete triangular meshes reconstructed from sample points on the...
Junfei Dai, Wei Luo, Shing-Tung Yau, Xianfeng Gu
FOCS
1999
IEEE
15 years 4 months ago
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...
Martin Farach-Colton, Piotr Indyk
ADBIS
2006
Springer
181views Database» more  ADBIS 2006»
15 years 5 months ago
Searching for Similar Trajectories on Road Networks Using Spatio-temporal Similarity
In order to search similar moving object trajectories, the previously used methods focused on Euclidean distance and considered only spatial similarity. Euclidean distance is not a...
Jung-Rae Hwang, Hye-Young Kang, Ki-Joune Li
STOC
2001
ACM
111views Algorithms» more  STOC 2001»
15 years 12 months ago
Optimal outlier removal in high-dimensional
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
John Dunagan, Santosh Vempala
GIS
2002
ACM
14 years 11 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...