Polyline simplification has cubic complexity
$\DeclareMathOperator{\poly}{poly}$In the classic polyline simplification problem, given a polygonal curve~$P$ consisting of $n$ vertices and an error threshold $\delta \geq 0$, we want to replace $P$ by a subsequence~$Q$ of minimal size such that the distance between the polygonal curves $P$ and $...
Tallennettuna:
| Päätekijät: | , |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
Carleton University
2021-01-01
|
| Sarja: | Journal of Computational Geometry |
| Linkit: | https://jocg.org/index.php/jocg/article/view/3120 |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|