235 search results - page 30 / 47 » The Complexity of Separating Points in the Plane |
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
— Single-track vehicles, such as motorcycles, provide an agile mobile platform. Modeling and control of motorcycles for agile maneuvers, such as those by professional racing ride...
116
click to vote
SMA
2009
ACM
15 years 4 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
This paper examines the computation of the Voronoi diagram of a set of ellipses in the Euclidean plane. We propose the first complete algorithms, under the exact computation para...
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
69
Voted
ICRA
2003
IEEE
15 years 2 months ago
2003
IEEE
Abstract— This paper addresses the problem of capturing an arbitrary convex object P in the plane with three congruent disc-shaped robots. Given two stationary robots in contact ...