EFFICIENT ALGORITHMS FOR SOLVING DIAGONAL VISIBILITY PROBLEMS IN A SIMPLE POLYGON (Q4858656)
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: EFFICIENT ALGORITHMS FOR SOLVING DIAGONAL VISIBILITY PROBLEMS IN A SIMPLE POLYGON |
scientific article; zbMATH DE number 826846
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | EFFICIENT ALGORITHMS FOR SOLVING DIAGONAL VISIBILITY PROBLEMS IN A SIMPLE POLYGON |
scientific article; zbMATH DE number 826846 |
Statements
EFFICIENT ALGORITHMS FOR SOLVING DIAGONAL VISIBILITY PROBLEMS IN A SIMPLE POLYGON (English)
0 references
18 December 1995
0 references
weak visibility
0 references
diagonal visibility
0 references
guard diagonal
0 references
0.8172917366027832
0 references
0.7793257832527161
0 references
0.7584100365638733
0 references
0.7583425045013428
0 references
0.7516396045684814
0 references
