A compact piecewise-linear voronoi diagram for convex sites in the plane

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 give a compact representation of the Voronoi diagram, using O(k) line segments, that is sufficient for logarithmic time post-office location queries and motion planning. If these sets are polygons with n total vertices, we compute this diagram optimally in O(klog n) deterministic time for the Euclidean metric and in O(klog nlog m) deterministic time for the convex distance function defined by a convex m-gon.<<ETX>>

[1]  Olivier Devillers,et al.  Fully Dynamic Delaunay Triangulation in Logarithmic Expected Time Per Operation , 1992, Comput. Geom..

[2]  Stefan Schirra.  Moving a disc between polygons , 1993, SCG '93.

[3]  Ketan Mulmuley,et al.  Computational geometry - an introduction through randomized algorithms , 1993 .

[4]  Gautam Das,et al.  Minimum Vertex Hulls for Polyhedral Domains , 1992, Theor. Comput. Sci..

[5]  Robert E. Tarjan,et al.  Planar point location using persistent search trees , 1986, CACM.

[6]  Jean-Daniel Boissonnat,et al.  The hierarchical representation of objects: the Delaunay tree , 1986, SCG '86.

[7]  Rolf Klein,et al.  Concrete and Abstract Voronoi Diagrams , 1990, Lecture Notes in Computer Science.

[8]  Micha Sharir,et al.  Planning, geometry, and complexity of robot motion , 1986 .

[9]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[10]  Micha Sharir,et al.  Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams , 2016, Discret. Comput. Geom..

[11]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[12]  Kurt Mehlhorn,et al.  On the Construction of Abstract Voronoi Diagrams, II , 1990, SIGAL International Symposium on Algorithms.

[13]  David G. Kirkpatrick,et al.  Tentative prune-and-search for computing Voronoi vertices , 1993, SCG '93.

[14]  Kurt Mehlhorn,et al.  On the Construction of Abstract Voronoi Diagrams , 1990, STACS.

[15]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[16]  Jirí Matousek,et al.  Piecewise linear paths among convex obstacles , 1993, STOC.

[17]  David Hsu,et al.  Computing the largest inscribed isothetic rectangle , 1995, CCCG.

[18]  C. A. Rogers,et al.  An Introduction to the Geometry of Numbers , 1959 .

[19]  Michael Ben-Or,et al.  Lower bounds for algebraic computation trees , 1983, STOC.

[20]  David G. Kirkpatrick,et al.  Efficient computation of continuous skeletons , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[21]  Gautam Das,et al.  Minimum Vertex Hulls for Polyhedral Domains , 1990, STACS.

[22]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[23]  Mariette Yvinec,et al.  Applications of random sampling to on-line algorithms in computational geometry , 1992, Discret. Comput. Geom..

[24]  Chee-Keng Yap,et al.  AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments , 1987, Discret. Comput. Geom..

[25]  Chee-Keng Yap,et al.  A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.

[26]  Jean-Daniel Boissonnat,et al.  On the Randomized Construction of the Delaunay Tree , 1993, Theor. Comput. Sci..

[27]  Steven Fortune,et al.  A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.

[28]  David G. Kirkpatrick,et al.  Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..

[29]  Robert L. Scot Drysdale,et al.  Voronoi diagrams based on convex distance functions , 1985, SCG '85.

[30]  David G. Kirkpatrick,et al.  Tentative Prune-and-Search for Computing Fixed-Points with Applications to Geometric Computation , 1995, Fundam. Informaticae.

[31]  Herbert Edelsbrunner,et al.  Computing the Extreme Distances Between Two Convex Polygons , 1985, J. Algorithms.

[32]  M. Iri,et al.  Construction of the Voronoi diagram for 'one million' generators in single-precision arithmetic , 1992, Proc. IEEE.

[33]  Kurt Mehlhorn,et al.  Randomized Incremental Construction of Abstract Voronoi Diagrams , 1993, Comput. Geom..

[34]  Bruce Randall Donald,et al.  Simplified Voronoi diagrams , 1987, SCG '87.

[35]  Kurt Mehlhorn,et al.  On the construction of abstract voronoi diagrams , 1990, STACS.

[36]  Leonidas J. Guibas,et al.  Optimal Point Location in a Monotone Subdivision , 1986, SIAM J. Comput..