Skip to main content

Mollified Zone Diagrams and Their Computation

  • Chapter
Transactions on Computational Science XIV

Part of the book series: Lecture Notes in Computer Science ((TCOMPUTATSCIE,volume 6970))

Abstract

The notion of the zone diagram of a finite set of points in the Euclidean plane is an interesting and rich variation of the classical Voronoi diagram, introduced by Asano, Matoušek, and Tokuyama [1]. In this paper, we define mollified versions of zone diagram named territory diagram and maximal territory diagram. A zone diagram is a particular maximal territory diagram satisfying a sharp dominance property. The proof of existence of maximal territory diagrams depends on less restrictive initial conditions and is established via Zorn’s lemma in contrast to the use of fixed-point theory in proving the existence of the zone diagram. Our proof of existence relies on a characterization which allows embedding any territory diagram into a maximal one. Our analysis of the structure of maximal territory diagrams is based on the introduction of a pair of dual concepts we call safe zone and forbidden zone. These in turn give rise to computational algorithms for the approximation of maximal territory diagrams. Maximal territory diagrams offer their own interesting theoretical and computational challenges, as well as insights into the structure of zone diagrams. This paper extends and updates previous work presented in [4].

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

Access this chapter

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.

References

  1. Asano, T., Matoušek, J., Tokuyama, T.: Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge. SIAM Journal on Computing 37, 1182–1198 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  2. Asano, T., Brimkov, V.E., Barneva, R.P.: Some theoretical challenges in digital geometry, A perspective. Discrete Applied Mathematics 157(16), 3362–3371 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Aurenhammer, F.: Voronoi diagrams - a survey of a fundamental geometric data structure. ACM Computing Surveys 23, 345–405 (1991)

    Article  Google Scholar 

  4. de Biasi, S.C., Kalantari, B., Kalantari, I.: Maximal Zone Diagrams and their Computation. In: ISVD 2010, pp. 171–180. IEEE Computer Society (2010)

    Google Scholar 

  5. Kalantari, B.: Voronoi Diagrams and Polynomial Root-Finding. In: ISVD 2009, pp. 31–40. IEEE Computer Society (2009)

    Google Scholar 

  6. Kalantari, B.: Polynomial Root-Finding Methods Whose Basins of Attraction Approximate Voronoi Diagram. Discrete & Computational Geometry (2011), doi:10.1007/s00454-011-9330-3

    Google Scholar 

  7. Reem, D.: An Algorithm for Computing Voronoi Diagrams of General Generators in General Normed Spaces. In: ISVD 2009, pp. 144–152. IEEE Computer Society (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

de Biasi, S.C., Kalantari, B., Kalantari, I. (2011). Mollified Zone Diagrams and Their Computation. In: Gavrilova, M.L., Tan, C.J.K., Mostafavi, M.A. (eds) Transactions on Computational Science XIV. Lecture Notes in Computer Science, vol 6970. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25249-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25249-5_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25248-8

  • Online ISBN: 978-3-642-25249-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics