Sciweavers

5019 search results - page 20 / 1004
» On the Reflexivity of Point Sets
Sort
View
TASE
2010
IEEE
13 years 3 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
EMMCVPR
2009
Springer
13 years 6 months ago
Intrinsic Second-Order Geometric Optimization for Robust Point Set Registration without Correspondence
Determining Euclidean transformations for the robust registration of noisy unstructured point sets is a key problem of model-based computer vision and numerous industrial applicati...
Dirk Breitenreicher, Christoph Schnörr
COMPGEOM
2004
ACM
14 years 1 months ago
On empty convex polygons in a planar point set
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
Rom Pinchasi, Rados Radoicic, Micha Sharir
SIAMCOMP
2000
97views more  SIAMCOMP 2000»
13 years 8 months ago
Dynamic Maintenance of Maxima of 2-d Point Sets
This paper describes an efficient scheme for the dynamic maintenance of the set of maxima of a 2-d set of points. Using the fact that the maxima can be stored in a staircase struct...
Sanjiv Kapoor
COMPGEOM
2004
ACM
14 years 1 months ago
Solution of Scott's problem on the number of directions determined by a point set in 3-space
Let P be a set of n points in Ê3 , not all in a common plane. We solve a problem of Scott (1970) by showing that the connecting lines of P assume at least 2n − 7 different dir...
János Pach, Rom Pinchasi, Micha Sharir