Shortest path to a segment and quickest visibility queries (Q5368719)
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 6789223
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest path to a segment and quickest visibility queries |
scientific article; zbMATH DE number 6789223 |
Statements
10 October 2017
0 references
path planning
0 references
visibility
0 references
query structures
0 references
complexity
0 references
persistent data structures
0 references
continuous Dijkstra
0 references
Shortest path to a segment and quickest visibility queries (English)
0 references
0.9999998807907104
0 references
0.8799103498458862
0 references
0.8747860789299011
0 references
0.8470163941383362
0 references
0.8203999996185303
0 references
