Computing the visibility polygon from a convex set and related problems (Q5750463)
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 4185086
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the visibility polygon from a convex set and related problems |
scientific article; zbMATH DE number 4185086 |
Statements
Computing the visibility polygon from a convex set and related problems (English)
0 references
1991
0 references
visibility polygon
0 references
minimum nested convex polygon
0 references
minimum link path
0 references
0.8169718980789185
0 references
0.8157474994659424
0 references
0.8093410134315491
0 references
0.8091531991958618
0 references
