On Romeo and Juliet problems: minimizing distance-to-sight (Q2331220)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7122176
| 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 7122176 |
Statements
On Romeo and Juliet problems: minimizing distance-to-sight (English)
0 references
25 October 2019
0 references
visibility polygon
0 references
shortest path
0 references
watchman problems
0 references
0 references
0.99999994
0 references
0.7875824
0 references
0.7875824
0 references
0.77869445
0 references
0 references
0 references
0 references
0.7635516
0 references
