Query-point visibility constrained shortest paths in simple polygons (Q2465622)
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: Query-point visibility constrained shortest paths in simple polygons |
scientific article; zbMATH DE number 5223665
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Query-point visibility constrained shortest paths in simple polygons |
scientific article; zbMATH DE number 5223665 |
Statements
Query-point visibility constrained shortest paths in simple polygons (English)
0 references
7 January 2008
0 references
computational geometry
0 references
shortest path
0 references
visibility
0 references
0 references
0.8884909152984619
0 references
0.8420148491859436
0 references
0.8351535201072693
0 references
0.8232560157775879
0 references
0.8203999996185303
0 references
