Capacity-Constrained Voronoi Diagrams in Continuous Spaces

@article{Balzer2009CapacityConstrainedVD,
  title={Capacity-Constrained Voronoi Diagrams in Continuous Spaces},
  author={Michael Balzer},
  journal={2009 Sixth International Symposium on Voronoi Diagrams},
  year={2009},
  pages={79-88}
}
A Voronoi diagram of a set of sites partitions a bounded space into regions of different areas. A capacity-constrained Voronoi diagram is a partition in which the area for each Voronoi region is predefined. In this paper, we present two approaches for computing such capacity-constrained Voronoi diagrams in continuous spaces. Our firstapproach is based on ordinary (non-weighted) distance functions and achieves the capacity constraint by a general optimization of the site locations. Our second… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, 2nd ed

  • A. Okabe, B. Boots, K. Sugihara, S. N. Chiu
  • 2000
1 Excerpt

Voronoi diagrams , ” in Handbook of Computational Geometry

  • F. Aurenhammer, R. Klein
  • Elsevier Science B . V .
  • 1999

A simplex method for function minimization

  • J. A. Nelder, R. Mead
  • The Computer Journal, vol. 7, no. 4, pp. 308– 313…
  • 1965
1 Excerpt

Similar Papers

Loading similar papers…