A compact piecewise-linear Voronoi diagram for convex sites in the plane, or, Simple paths in a complex world
In the plane, the post-office problem, which asks for the closest site to a query site, and retraction motion planning, which asks for a one-dimensional retract of the free space of a robot, are both classically solved by computing a Voronoi diagram. When the sites are k disjoint convex sets, we giv...
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
2008
|
| Online Access: | http://hdl.handle.net/2429/2000 |