A natural metric for curves — Computing the distance for polygonal chains and approximation algorithms

  • Michael Godau
Algorithms I

DOI: 10.1007/BFb0020793

Part of the Lecture Notes in Computer Science book series (LNCS, volume 480)
Cite this paper as:
Godau M. (1991) A natural metric for curves — Computing the distance for polygonal chains and approximation algorithms. In: Choffrut C., Jantzen M. (eds) STACS 91. STACS 1991. Lecture Notes in Computer Science, vol 480. Springer, Berlin, Heidelberg

Abstract

The often explored problem to approximate a given polygonal chain has been considered from a computational geometric point of view only for a short time. To model it reasonably we give a natural definition of the distance between curves. Furthermore we give algorithms to calculate this distance between two polygonal chains in the d-dimensional space for arbitrary d. With known methods this yields polynomial time algorithms to approximate polygonal chains. These algorithms find an optimal solution under some constraints. We will show that this solution is only by a constant factor worse than the global optimum.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1991

Authors and Affiliations

  • Michael Godau
    • 1
  1. 1.FB Mathematik, WE 03Freie Universität BerlinBerlin 33

Personalised recommendations