Given a polygonal path P with vertices p1,p2,...,pn and a real number t ≥ 1, a path Q = (pi1, pi2,...,pik) is a t-distance-preserving approximation of P if 1 = i1 < i2 < ik = n and each straight-line edge (pij,pij+1) of Q approximates the distance between pij and pij+1 along the path P within a factor of t. We present exact and approximation algorithms that compute such a path Q that minimizes k (when given t) or t (when given k). We also present some experimental results. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Gudmundsson, J., Narasimhan, G., & Smid, M. (2003). Distance-preserving approximations of polygonal paths. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2914, 217–228. https://doi.org/10.1007/978-3-540-24597-1_19
Mendeley helps you to discover research relevant for your work.