Improved upper bounds on the shortest watchman route in simple polygons: Dependence on reflex vertices and triangulation strategies
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61384399%3A31140%2F25%3A00062156" target="_blank" >RIV/61384399:31140/25:00062156 - isvavai.cz</a>
Result on the web
<a href="https://annals-csis.org/Volume_43/drp/pdf/4752.pdf" target="_blank" >https://annals-csis.org/Volume_43/drp/pdf/4752.pdf</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.15439/2025F4752" target="_blank" >10.15439/2025F4752</a>
Alternative languages
Result language
angličtina
Original language name
Improved upper bounds on the shortest watchman route in simple polygons: Dependence on reflex vertices and triangulation strategies
Original language description
Main topics of the document: watchman route; simple polygon; reflex vertices; computational geometry; art gallery problem; polygon visibility; upper bounds; triangulation strategies; shortest path; autonomous navigation
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
2025
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 20th Conference on Computer Science and Intelligence Systems (FedCSIS)
ISBN
978-83-973291-6-4
ISSN
2300-5963
e-ISSN
2300-5963
Number of pages
6
Pages from-to
789-794
Publisher name
FedCSIS
Place of publication
Polsko
Event location
Krakov, Polsko
Event date
Sep 14, 2025
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—