Finding an approximate minimum-link visibility path inside a simple polygon (Q672401)
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: Finding an approximate minimum-link visibility path inside a simple polygon |
scientific article; zbMATH DE number 984968
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding an approximate minimum-link visibility path inside a simple polygon |
scientific article; zbMATH DE number 984968 |
Statements
Finding an approximate minimum-link visibility path inside a simple polygon (English)
0 references
28 February 1997
0 references
computational geometry
0 references
approximation algorithms
0 references
simple polygon
0 references
visibility path
0 references
minimum link path
0 references
0.8917478919029236
0 references
0.8829190731048584
0 references
0.8625039458274841
0 references
0.8285161852836609
0 references
0.8261802792549133
0 references
