Document Open Access Logo

Interactive Uniform Floodlight Illumination and Rotating Rays Voronoi Diagrams (Media Exposition)

Authors Carlos Alegría , Ioannis Mantas , Marko Savić , Martin Suderland

PDF

File

Thumbnail PDF
PDF
LIPIcs.SoCG.2026.98.pdf
  • Filesize: 2.36 MB
  • 7 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
Keywords
  • rotating rays Voronoi diagram
  • oriented angular distance
  • unoriented angular distance
  • Brocard angle
  • floodlight illumination
  • coverage problems
  • visualization software

Metrics

Abstract

Floodlight illumination problems are art-gallery variants, where a target domain needs to be illuminated by guards, each associated with a field of view. The rotating rays Voronoi diagram is a Voronoi diagram with rays as sites under the angular distance. There is a natural connection of this Voronoi structure with the problem of finding the minimum aperture such that a given set of uniform aperture floodlights illuminates a target domain. In this work we present an interactive visualization software for such problems, supporting different angular distances, namely, oriented and unoriented versions, and for different domains, namely, the plane and simple polygons.

Cite As Get BibTex

Carlos Alegría, Ioannis Mantas, Marko Savić, and Martin Suderland. Interactive Uniform Floodlight Illumination and Rotating Rays Voronoi Diagrams (Media Exposition). In 42nd International Symposium on Computational Geometry (SoCG 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 367, pp. 98:1-98:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.SoCG.2026.98

Author Details

Carlos Alegría
  • FormX Inc., Sunnyvale, CA, USA
Ioannis Mantas
  • Planlabs, Zurich, Switzerland
Marko Savić
  • Department of Mathematics and Informatics, Faculty of Sciences, University of Novi Sad, Serbia
Martin Suderland
  • Independent Researcher, Lugano, Switzerland

Funding

  • Savić, Marko: Partly supported by the Ministry of Science, Technological Development and Innovation of the Republic of Serbia (Grants No. 451-03-33/2026-03/ 200125 & 451-03-34/2026-03/ 200125) and by the Science Fund of the Republic of Serbia, #7462, Graphs in Space and Time: Graph Embeddings for Machine Learning in Complex Dynamical Systems - TIGRA.

Supplementary Materials

References

  1. Carlos Alegría, Ioannis Mantas, Evanthia Papadopoulou, Marko Savić, Carlos Seara, and Martin Suderland. The Voronoi diagram of rotating rays with applications to floodlight illumination. Algorithmica, 88(2):27, 2026. URL: https://doi.org/10.1007/s00453-025-01368-y.
  2. Carlos Alegría, Ioannis Mantas, Marko Savić, and Martin Suderland. RVD-explorer. Software, version 0.1.0., (visited on 2026-05-13). URL: https://github.com/VD-collective/rvd-explorer
    Software Heritage Logo archived version
    full metadata available at: https://doi.org/10.4230/artifacts.26033
  3. Carlos Alegría-Galicia, David Orden, Carlos Seara, and Jorge Urrutia. Illuminating polygons by edge-aligned floodlights of uniform angle (Brocard illumination). In Proceedings of the 33rd European Workshop on Computational Geometry (EuroCG 2017), pages 281-284, 2017. Google Scholar
  4. Omur Arslan, Hancheng Min, and Daniel E. Koditschek. Voronoi-based coverage control of pan/tilt/zoom camera networks. In 2018 IEEE International Conference on Robotics and Automation (ICRA 2018), pages 5062-5069. IEEE, 2018. URL: https://doi.org/10.1109/icra.2018.8460701.
  5. Tetsuo Asano, Hisao Tamaki, Naoki Katoh, and Takeshi Tokuyama. Angular Voronoi diagram with applications. In 2006 3rd International Symposium on Voronoi Diagrams in Science and Engineering, pages 18-24. IEEE, 2006. URL: https://doi.org/10.1109/ISVD.2006.9.
  6. Franz Aurenhammer, Rolf Klein, and Der-Tsai Lee. Voronoi Diagrams and Delaunay Triangulations. World Scientific, 2013. URL: https://doi.org/10.1142/8685.
  7. Piotr Berman, Jieun Jeong, Shiva P. Kasiviswanathan, and Bhuvan Urgaonkar. Packing to angles and sectors. In Proceedings of the 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'07), pages 171-180, 2007. URL: https://doi.org/10.1145/1248377.1248405.
  8. Prosenjit Bose, Anna Lubiw, and J. Ian Munro. Efficient visibility queries in simple polygons. Computational Geometry, 23(3):313-335, 2002. URL: https://doi.org/10.1016/s0925-7721(01)00070-0.
  9. Mark de Berg, Joachim Gudmundsson, Herman Haverkort, and Michael Horton. Voronoi diagrams with rotational distance costs. In Abstracts of the Computational Geometry Week: Young Researchers Forum (CG:YRF), 2017. Google Scholar
  10. Leonidas J Guibas, Rajeev Motwani, and Prabhakar Raghavan. The robot localization problem. SIAM Journal on Computing, 26(4):1120-1138, 1997. URL: https://doi.org/10.1137/S0097539792233257.
  11. Herman Haverkort and Rolf Klein. Hyperbolae are the locus of constant angle difference. arXiv preprint arXiv:2112.00454, 2021. URL: https://arxiv.org/abs/2112.00454.
  12. Evangelos Kranakis, Danny Krizanc, and Oscar Morales. Maintaining connectivity in sensor networks using directional antennae. In Theoretical Aspects of Distributed Computing in Sensor Networks, pages 59-84. Springer, 2011. URL: https://doi.org/10.1007/978-3-642-14849-1_3.
  13. Der-Tsai Lee and Ying-Fung Wu. Geometric complexity of some location problems. Algorithmica, 1(1):193-211, 1986. URL: https://doi.org/10.1007/BF01840442.
  14. Ioannis Mantas. Problems on Planar Voronoi Diagrams. PhD thesis, Università della Svizzera Italiana, 2022. Google Scholar
  15. Azin Neishaboori, Ahmed Saeed, Khaled A. Harras, and Amr Mohamed. On target coverage in mobile visual sensor networks. In Proceedings of the 12th ACM International Symposium on Mobility Management and Wireless Access (MobiWac'15), pages 39-46, 2014. URL: https://doi.org/10.1145/2642668.2642671.
  16. Atsuyuki Okabe, Barry Boots, Kokichi Sugihara, and Sung Nok Chiu. Spatial tessellations: concepts and applications of Voronoi diagrams, volume 501. John Wiley & Sons, 2009. Google Scholar
  17. Joseph O'Rourke. Art gallery theorems and algorithms, volume 57. Oxford University Press Oxford, 1987. Google Scholar
  18. Joseph O'Rourke. Visibility. In Handbook of Discrete and Computational Geometry, pages 875-896. CRC Press, 2017. Google Scholar
  19. Vera Sacristán. Lower bounds for some geometric problems. Technical report, Technical Report MA2-IR-98, 1998. Google Scholar
  20. Micha Sharir. Almost tight upper bounds for lower envelopes in higher dimensions. Discrete & Computational Geometry, 12(3):327-345, 1994. URL: https://doi.org/10.1007/BF02574384.
  21. Tsuyoshi Taki, Jun-ichi Hasegawa, and Teruo Fukumura. Development of motion analysis system for quantitative evaluation of teamwork in soccer games. In Proceedings of the 3rd IEEE International Conference on Image Processing, volume 3, pages 815-818. IEEE, 1996. URL: https://doi.org/10.1109/ICIP.1996.560865.
  22. Jorge Urrutia. Art gallery and illumination problems. In Handbook of Computational Geometry, pages 973-1027. Elsevier, 2000. URL: https://doi.org/10.1016/B978-044482537-7/50023-1.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

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