The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Dilation, smoothed distance, and minimization diagrams of convex functions
[article]
2010
arXiv
pre-print
We study Voronoi diagrams for distance functions that add together two convex functions, each taking as its argument the difference between Cartesian coordinates of two planar points. When the functions do not grow too quickly, then the Voronoi diagram has linear complexity and can be constructed in near-linear randomized expected time. Additionally, the level sets of the distances from the sites form a family of pseudocircles in the plane, all cells in the Voronoi diagram are connected, and
arXiv:0812.0607v2
fatcat:ifbgwo3ggvfe3ncramvb2zashy