COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON (Q4513233)
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: COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON |
scientific article; zbMATH DE number 1526827
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON |
scientific article; zbMATH DE number 1526827 |
Statements
COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON (English)
0 references
7 November 2000
0 references
polygon
0 references
weak visibility
0 references
external visibility
0 references
shortest visible line segment
0 references
0 references
0.96418023
0 references
0.9173402
0 references
0.89684874
0 references
0.87589324
0 references
0.87583697
0 references
