Skip to main content

Maximizing a Voronoi Region: The Convex Case

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2518))

Included in the following conference series:

Abstract

Given a set S of s points in the plane, where do we place a new point, p, in order to maximize the area of its region in the Voronoi diagram of S and p? We study the case where the Voronoi neighbors of p are in convex position, and prove that there is at most one local maximum.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai Golin, and René van Oostrum. Competitive facility location along a highway. Proc. 7th Annu. Int. Conf. (COCOON 2001), Lecture Notes Comput. Sci.(2108):237–246, 2001.

    Google Scholar 

  2. Franz Aurenhammer and Rolf Klein. Voronoi diagrams. In Jörg-Rüdiger Sack and Jorge Urrutia, editors, Handbook of Computational Geometry, pages 201–290. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000.

    Chapter  Google Scholar 

  3. Otfried Cheong, Sariel Har-Peled, Nathan Linial, and Jiří Matoušek. The one-und Voronoi game. Proc. 18th Annu. ACM Symp. on Computational Geometry, 2002.

    Google Scholar 

  4. S. Fortune. Voronoi diagrams and Delaunay triangulations. In Jacob E. Goodman and Joseph O’Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 20, pages 377–388. CRC Press LLC, Boca Raton, FL, 1997.

    Google Scholar 

  5. Atsuyuki Okabe and M. Aoyagi. Existence of equilibrium configurations of competitive firms on an infinite two-dimensional space. J. of Urban Economics, 29:349–370, 1991.

    Article  MATH  Google Scholar 

  6. Atsuyuki Okabe, Barry Boots, Kokichi Sugihara, and Sung Nok Chiu. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. John Wiley & Sons, Chichester, UK, 2000.

    MATH  Google Scholar 

  7. B. Piper. Properties of local coordinates based on dirichlet tessellations. Computing Suppl., 8:227–239, 1993.

    MathSciNet  Google Scholar 

  8. Micha Sharir and P. K. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York, 1995.

    MATH  Google Scholar 

  9. R. Sibson. A Brief Description of the Natural Neighbor Interpolant. In: D.V. Barnett (ed.) Interpolation Multiariate Data. Wiley, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dehne, F., Klein, R., Seidel, R. (2002). Maximizing a Voronoi Region: The Convex Case. In: Bose, P., Morin, P. (eds) Algorithms and Computation. ISAAC 2002. Lecture Notes in Computer Science, vol 2518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36136-7_54

Download citation

  • DOI: https://doi.org/10.1007/3-540-36136-7_54

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00142-3

  • Online ISBN: 978-3-540-36136-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics