Computing simple paths from given points inside a polygon (Q1630775)
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 6991563
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing simple paths from given points inside a polygon |
scientific article; zbMATH DE number 6991563 |
Statements
Computing simple paths from given points inside a polygon (English)
0 references
10 December 2018
0 references
computational geometry
0 references
visibility graph
0 references
simple paths
0 references
shortest paths
0 references
Dijkstra paradigm
0 references
0.9520630240440368
0 references
0.9057053327560424
0 references
0.8478627800941467
0 references
0.8455929160118103
0 references
0.800193727016449
0 references
