401 search results - page 55 / 81 » Algorithms for a Simple Point Placement Problem |
COMPGEOM
2007
ACM
15 years 3 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
BMVC
2001
15 years 2 months ago
2001
This paper describes an algorithm for shape estimation in cluttered scenes. A new image potential is defined based on strokes detected in the image. The motivation is simple. Fea...
122
click to vote
ECCV
2008
Springer
16 years 1 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
COMGEO
2004
ACM
14 years 11 months ago
2004
ACM
Dot maps--drawings of point sets--are a well known cartographic method to visualize density functions over an area. We study the problem of simplifying a given dot map: given a se...
114
click to vote
ECCV
2002
Springer
16 years 1 months ago
2002
Springer
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...