Skip to main content
Conference ProceedingsOPEN ACCESS

Illuminating polygons with vertex π-floodlights

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2073 772-781
DOI: 10.1007/3-540-45545-0_89
3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

It is shown that any simple polygon with n vertices can be illuminated by at most (Formula Presented.) vertex π -floodlights. This improves the earlier bound n−2, whereas the best lower bound remains 3n/5+c.

Cite

CITATION STYLE

APA

Tóth, C. D. (2001). Illuminating polygons with vertex π-floodlights. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2073, pp. 772–781). Springer Verlag. https://doi.org/10.1007/3-540-45545-0_89

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free