A lower bound for proportion of visibility polygon's surface to entire polygon's surface: Estimated by Art Gallery Problem and proven that cannot be greatly improved
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61384399%3A31140%2F23%3A00059928" target="_blank" >RIV/61384399:31140/23:00059928 - isvavai.cz</a>
Result on the web
<a href="https://annals-csis.org/Volume_35/drp/pdf/4335.pdf" target="_blank" >https://annals-csis.org/Volume_35/drp/pdf/4335.pdf</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.15439/2023F4335" target="_blank" >10.15439/2023F4335</a>
Alternative languages
Result language
angličtina
Original language name
A lower bound for proportion of visibility polygon's surface to entire polygon's surface: Estimated by Art Gallery Problem and proven that cannot be greatly improved
Original language description
Main topics of the document: visibility polygon; visibility polygon's surface; lower bound estimation; estimation effectiveness; art gallery problem
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2023
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 18th Conference on Computer Science and Intelligence Systems
ISBN
978-83-967447-8-4
ISSN
2300-5963
e-ISSN
2300-5963
Number of pages
5
Pages from-to
1229-1233
Publisher name
Annals of Computer Science and Intelligence Systems
Place of publication
Polsko
Event location
Varšava
Event date
Sep 17, 2023
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—