Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon (Q4881404)
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: Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon |
scientific article; zbMATH DE number 885497
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon |
scientific article; zbMATH DE number 885497 |
Statements
Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon (English)
0 references
9 June 1996
0 references
CREW PRAM computational model
0 references
0.8720223307609558
0 references
0.8687317967414856
0 references
0.8625816702842712
0 references
0.8325414657592773
0 references
