We address the problem of continuously transforming or morphing one simple polyline into another so that every point p of the initial polyline moves to a point q of the final polyline using the geodesic shortest path from p to q. We optimize the width of the morphing, that is, the longest geodesic path between p and q. We present a linear-time algorithm for finding a morphing with width guaranteed to be at most 1.618 times the minimum width of a morphing. This improves the previous algorithm [9] by a factor of log n. We also develop a linear-time algorithm for computing a medial axis separator. © Springer-Verlag 2003.
CITATION STYLE
Bespamyatnikh, S. (2003). An approximate morphing between polylines. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2669, 807–816. https://doi.org/10.1007/3-540-44842-x_82
Mendeley helps you to discover research relevant for your work.