A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible (Q4037437)
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 177566
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible |
scientific article; zbMATH DE number 177566 |
Statements
18 May 1993
0 references
linear time algorithm
0 references
shortest line segment from which a simple polygon is weakly externally visible
0 references
0.9750614762306212
0 references
0.8984440565109253
0 references
0.8502851724624634
0 references
A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible (English)
0 references
