Discrete Fréchet distance oracles
It is unlikely that the discrete Fréchet distance between two curves of length $n$ can be computed in strictly subquadratic time. We thus consider the setting where one of the curves, $P$, is known in advance. In particular, we wish to construct data structures (distance oracles) of near-linear siz...
Na minha lista:
| Principais autores: | , , , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Carleton University
2025-05-01
|
| Serier: | Journal of Computational Geometry |
| Online adgang: | https://jocg.org/index.php/jocg/article/view/5299 |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|