On Romeo and Juliet problems: minimizing distance-to-sight (Q5116469)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On Romeo and Juliet problems: minimizing distance-to-sight |
scientific article; zbMATH DE number 7238961
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Romeo and Juliet problems: minimizing distance-to-sight |
scientific article; zbMATH DE number 7238961 |
Statements
25 August 2020
0 references
visibility polygon
0 references
shortest-path
0 references
watchman problems
0 references
0 references
On Romeo and Juliet Problems: Minimizing Distance-to-Sight. (English)
0 references
0.9980236887931824
0 references
0.7730302214622498
0 references
0.7619231343269348
0 references
0.7548975944519043
0 references
