The Hausdorff Voronoi Diagram of Point Clusters in the Plane

@article{Papadopoulou2004TheHV,
  title={The Hausdorff Voronoi Diagram of Point Clusters in the Plane},
  author={Evanthia Papadopoulou},
  journal={Algorithmica},
  year={2004},
  volume={40},
  pages={63-82}
}
We study the Hausdorff Voronoi diagram of point clusters in the plane, a generalization ofVoronoi diagrams based on the Hausdorff distance function. We derive a tight combinatorial bound on the structural complexity of this diagram and present a plane sweep algorithm for its construction. In particular, we show that the size of the Hausdorff Voronoi diagram is Θ(n + m), where n is the number of points on the convex hulls of the given clusters, and m is the number of crucial supporting segments… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…