Abstract
Given a set of polygonal curves we seek to find a middle curve that represents the set of curves. We require that the middle curve consists of points of the input curves and that it minimizes the discrete Fréchet distance to the input curves. We present algorithms for three different variants of this problem: computing an ordered middle curve, computing an ordered and restricted middle curve, and computing an unordered middle curve.
Cite
CITATION STYLE
Ahn, H. K., Alt, H., Buchin, M., Oh, E., Scharf, L., & Wenk, C. (2016). A middle curve based on discrete Fréchet distance. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9644, pp. 14–26). Springer Verlag. https://doi.org/10.1007/978-3-662-49529-2_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
