Document Open Access Logo

Linear Expected Complexity for Directional and Multiplicative Voronoi Diagrams

Authors Chenglin Fan, Benjamin Raichel

PDF
Thumbnail PDF

File

LIPIcs.ESA.2020.45.pdf
  • Filesize: 0.61 MB
  • 18 pages

Document Identifiers

Author Details

Chenglin Fan
  • Department of Computer Science, University of Texas at Dallas, Richardson, TX, USA
Benjamin Raichel
  • Department of Computer Science, University of Texas at Dallas, Richardson, TX, USA

Funding

Partially supported by NSF CRII Award 1566137 and CAREER Award 1750780.

Acknowledgements

The authors want to thank Sariel Har-Peled for useful discussions concerning the case of sampled site locations. Also, thank you to the reviewers for their helpful comments.

Cite As Get BibTex

Chenglin Fan and Benjamin Raichel. Linear Expected Complexity for Directional and Multiplicative Voronoi Diagrams. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 45:1-45:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020) https://doi.org/10.4230/LIPIcs.ESA.2020.45

Abstract

While the standard unweighted Voronoi diagram in the plane has linear worst-case complexity, many of its natural generalizations do not. This paper considers two such previously studied generalizations, namely multiplicative and semi Voronoi diagrams. These diagrams both have quadratic worst-case complexity, though here we show that their expected complexity is linear for certain natural randomized inputs. Specifically, we argue that the expected complexity is linear for: (1) semi Voronoi diagrams when the visible direction is randomly sampled, and (2) for multiplicative diagrams when either weights are sampled from a constant-sized set, or the more challenging case when weights are arbitrary but locations are sampled from a square.

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
Keywords
  • Voronoi Diagrams
  • Expected Complexity
  • Computational Geometry

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Pankaj K. Agarwal, Sariel Har-Peled, Haim Kaplan, and Micha Sharir. Union of random Minkowski sums and network vulnerability analysis. Discrete & Computational Geometry, 52(3):551-582, 2014. Google Scholar
  2. Boris Aronov, Mark de Berg, and Shripad Thite. The complexity of bisectors and Voronoi diagrams on realistic terrains. In Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings, pages 100-111, 2008. Google Scholar
  3. Franz Aurenhammer. Power diagrams: Properties, algorithms and applications. SIAM J. Comput., 16(1):78-96, 1987. URL: https://doi.org/10.1137/0216006.
  4. Franz Aurenhammer and Herbert Edelsbrunner. An optimal algorithm for constructing the weighted voronoi diagram in the plane. Pattern Recognition, 17(2):251-257, 1984. Google Scholar
  5. Franz Aurenhammer, Rolf Klein, and Der-Tsai Lee. Voronoi Diagrams and Delaunay Triangulations. World Scientific, 2013. Google Scholar
  6. Franz Aurenhammer, Bing Su, Yin-Feng Xu, and Binhai Zhu. A note on visibility-constrained Voronoi diagrams. Discrete Applied Mathematics, 174:52-56, 2014. Google Scholar
  7. Marcin Bienkowski, Valentina Damerow, Friedhelm Meyer auf der Heide, and Christian Sohler. Average case complexity of Voronoi diagrams of n sites from the unit cube. In (Informal) Proceedings of the 21st European Workshop on Computational Geometry (EuroCG), pages 167-170, 2005. Google Scholar
  8. Timothy M. Chan and Konstantinos Tsakalidis. Optimal deterministic algorithms for 2-d and 3-d shallow cuttings. Discret. Comput. Geom., 56(4):866-881, 2016. URL: https://doi.org/10.1007/s00454-016-9784-4.
  9. Hsien-Chih Chang, Sariel Har-Peled, and Benjamin Raichel. From proximity to utility: A Voronoi partition of Pareto optima. Discrete & Computational Geometry, 56(3):631-656, 2016. Google Scholar
  10. Yongxi Cheng, Bo Li, and Yinfeng Xu. Semi Voronoi diagrams. In Computational Geometry, Graphs and Applications - 9th International Conference, CGGA 2010, Dalian, China, November 3-6, 2010, Revised Selected Papers, pages 19-26, 2010. Google Scholar
  11. Anne Driemel, Sariel Har-Peled, and Benjamin Raichel. On the expected complexity of Voronoi diagrams on terrains. ACM Trans. Algorithms, 12(3):37:1-37:20, 2016. Google Scholar
  12. R. Dwyer. Higher-dimensional Voronoi diagrams in linear expected time. In Proc. 5th Annual Symposium on Computational Geometry (SOCG), pages 326-333, 1989. URL: https://doi.org/10.1145/73833.73869.
  13. Chenglin Fan, Jun Luo, Wencheng Wang, and Binhai Zhu. Voronoi diagram with visual restriction. Theor. Comput. Sci., 532:31-39, 2014. Google Scholar
  14. Steven Fortune. A sweepline algorithm for voronoi diagrams. Algorithmica, 2:153-174, 1987. URL: https://doi.org/10.1007/BF01840357.
  15. Jacob E. Goodman and Joseph O'Rourke, editors. Handbook of Discrete and Computational Geometry, Second Edition. Chapman and Hall/CRC, 2004. Google Scholar
  16. Sariel Har-Peled, Haim Kaplan, and Micha Sharir. Approximating the k-level in three-dimensional plane arrangements. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1193-1212, 2016. URL: https://doi.org/10.1137/1.9781611974331.ch83.
  17. Sariel Har-Peled and Benjamin Raichel. On the complexity of randomly weighted multiplicative Voronoi diagrams. Discrete & Computational Geometry, 53(3):547-568, 2015. Google Scholar
  18. D. T. Lee and Robert L. (Scot) Drysdale III. Generalization of voronoi diagrams in the plane. SIAM J. Comput., 10(1):73-87, 1981. URL: https://doi.org/10.1137/0210006.
  19. Micha Sharir. Intersection and closest-pair problems for a set of planar discs. SIAM J. Comput., 14(2):448-468, 1985. URL: https://doi.org/10.1137/0214034.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact