An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment (Q4033762)
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: An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment |
scientific article; zbMATH DE number 166204
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment |
scientific article; zbMATH DE number 166204 |
Statements
An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment (English)
0 references
16 May 1993
0 references
visibility of a polygon
0 references
weakly visible
0 references
0.9185358
0 references
0.9133565
0 references
0.9012853
0 references
0.8985592
0 references
0.89824843
0 references
0.8974396
0 references
0.89684874
0 references
