On optimal polyline simplification using the Hausdorff and Fréchet distance
We revisit the classical polygonal line simplification problem and study it using the Hausdorff distance and Fréchet distance. Interestingly, no previous authors studied line simplification under these measures in its pure form, namely: for a given ε > 0, choose a minimum size subsequence of the ve...
Збережено в:
| Автори: | , , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
Carleton University
2020-03-01
|
| Серія: | Journal of Computational Geometry |
| Онлайн доступ: | https://jocg.org/index.php/jocg/article/view/3091 |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|