Sampling-based bottleneck pathfinding with applications to Fréchet matching (Q4606351)
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: Sampling-based bottleneck pathfinding with applications to Fréchet matching |
scientific article; zbMATH DE number 6846447
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sampling-based bottleneck pathfinding with applications to Fréchet matching |
scientific article; zbMATH DE number 6846447 |
Statements
2 March 2018
0 references
computational geometry
0 references
Fréchet distances
0 references
sampling-based algorithms
0 references
random geometric graphs
0 references
bottleneck pathfinding
0 references
0.7325462102890015
0 references
0.7304630279541016
0 references
0.7270349860191345
0 references
0.7265723347663879
0 references
