Sciweavers

133 search results - page 10 / 27
» On the distinct distances determined by a planar point set
Sort
View
SIAMCOMP
2000
125views more  SIAMCOMP 2000»
13 years 7 months ago
Approximating the Stretch Factor of Euclidean Graphs
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
Giri Narasimhan, Michiel H. M. Smid
SIGMOD
2000
ACM
173views Database» more  SIGMOD 2000»
13 years 11 months ago
Efficient Algorithms for Mining Outliers from Large Data Sets
In this paper, we propose a novel formulation for distance-based outliers that is based on the distance of a point from its kth nearest neighbor. We rank each point on the basis o...
Sridhar Ramaswamy, Rajeev Rastogi, Kyuseok Shim
3DIM
2007
IEEE
14 years 2 months ago
Outlier Robust ICP for Minimizing Fractional RMSD
We describe a variation of the iterative closest point (ICP) algorithm for aligning two point sets under a set of transformations. Our algorithm is superior to previous algorithms...
Jeff M. Phillips, Ran Liu, Carlo Tomasi
ICPR
2006
IEEE
14 years 9 months ago
Geodesic Curves for Analysis of Continuous Implicit Shapes
A method is proposed for performing shape analysis of m-surfaces, e.g. planar curves and surfaces, with a geometric interpretation. The analysis uses an implicit surface represent...
Jan Erik Solem
ECCV
2010
Springer
13 years 8 months ago
Geodesic Shape Retrieval via Optimal Mass Transport
This paper presents a new method for 2-D and 3-D shape retrieval based on geodesic signatures. These signatures are high dimensional statistical distributions computed by extractin...
Julien Rabin, Gabriel Peyré, Laurent D. Coh...