Computing shortest paths among curved obstacles in the plane (Q5174497)
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 6405150
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing shortest paths among curved obstacles in the plane |
scientific article; zbMATH DE number 6405150 |
Statements
Computing shortest paths among curved obstacles in the plane (English)
0 references
17 February 2015
0 references
Voronoi diagrams
0 references
curved obstacles
0 references
relevant visibility graphs
0 references
shortest paths
0 references
splinegons
0 references
tangent graphs
0 references
0.9481338858604432
0 references
0.8710480332374573
0 references
0.8621828556060791
0 references
0.8382315635681152
0 references
0.8361346125602722
0 references
