839 search results - page 41 / 168 » Three-Clustering of Points in the Plane |
CCCG
2006
13 years 10 months ago
2006
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
SODA
1996
ACM
13 years 10 months ago
1996
ACM
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
TROB
2002
13 years 8 months ago
2002
-- The initial resting pose of many industrial parts differs from the orientation desired for assembly. We show that it is possible to align parts during grasping using a standard ...
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
— Scan matching techniques have been widely used to compute the displacement of robots. This estimate is part of many algorithms addressing navigation and mapping. This paper add...
JCDCG
2004
Springer
14 years 2 months ago
2004
Springer
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...