We present a general framework for computing two-dimensional Voronoi diagrams of different classes of sites under various distance functions. Most diagrams mentioned in the paper ...
— This paper presents a new Path Planning method which operates in two steps. In the first step the safest areas in the environment are extracted by means of a Voronoi diagram. ...
We describe conditions under which an appropriately-defined anisotropic Voronoi diagram of a set of sites in Euclidean space is guaranteed to be composed of connected cells in an...
We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fréchet distance, and the diameter for a polyhedral surface. Distances on the surface a...
Abstract. We give analytic inclusion-exclusion formulas for the area and perimeter derivatives of a union of finitely many disks in the plane. Keywords. Disks, Voronoi diagram, al...