235 search results - page 19 / 47 » The Complexity of Separating Points in the Plane |
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that ...
103
click to vote
IJFCS
2002
14 years 9 months ago
2002
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Many applications require a computer representation of 2D shape, usually described by a set of 2D points. The challenge of this representation is that it must not only capture the...
ICRA
1998
IEEE
15 years 1 months ago
1998
IEEE
This paper describes a multi-loop, modular navigation architecture for mobile robots whose structure allows the execution of most types of navigation tasks in a highly robust mann...
108
click to vote
ICDCS
2010
IEEE
14 years 7 months ago
2010
IEEE
Advances in wireless vehicular networks present us with opportunities for developing new distributed traffic control algorithms that avoid phenomena such as abrupt phase-transition...