Line Simplification with Restricted Orientations

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1663)


We study the C-oriented line simplification problem: Given a polygonal chain P represented by an ordered set of vertices p 1,...,p n in the plane, a set of orientations C, and a constant , we search for a “C-oriented” polygonal chain Q consisting of the minimum number of line segments that has distance at most ε to P in the Fréechet metric. A polygonal chain is C-oriented if the line segments are parallel to orientations in C. We restrict our attention to the version of the problem where two circles of radius formed around adjacent vertices of the polygonal chain do not intersect. We solve the C-oriented line simplification problem constructively by using dynamic programming together with a nice data structure. For usual cases of C our algorithm solves the problem in time O(kn 2log(n)) where k is the minimum number of line segments of Q and uses O(kn 2) space.


Line Segment Recursion Formula Line Simplification Reachable Region Orthogonal Orientation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AG93]
    Alt, H., Godau, M.: Computing the Fréchet Distance Between Two Polygonal curves. International Journal of Computational Geometry & Applications 5 (1995) 75–91MathSciNetzbMATHCrossRefGoogle Scholar
  2. [AG96]
    Alt, H., Guibas, L. J.: Discrete Geometric Shapes: Matching, Interpolation, and Approximation a Survey. Research paper B 96-11, Institute of Computer Science, Freie Universität Berlin (1996)Google Scholar
  3. [AOS94]
    Adegeest, J., Overmars, M., Snoeyink, J. S.: Minimum Link C-oriented Paths: Single-Source Queries. International Journal of Computational Geometry & Applications 4(1) (1994) 39–51MathSciNetzbMATHCrossRefGoogle Scholar
  4. [DP73]
    Douglas, D. H., Peucker, T. K.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. The Canadian Geographer 10(2) (1973) 112–122Google Scholar
  5. [GHMS93]
    Guibas, L. J., Hershberger, J. E., Mitchell, J. S. B., Snoeyink, J. S.: Approximating Polygons and Subdivisions with Minimum Link Paths. International Journal of Computational Geometry & Applications 3(4) (1993) 383–415MathSciNetzbMATHCrossRefGoogle Scholar
  6. [God91]
    Godau, M.: Die Fréchet-Metrik für Polygonzüge-Algorithmen zur Abstandsmessung und Approximation. Diplomarbeit, Institute of Computer Science, Freie Universität, Berlin (1991)Google Scholar
  7. [God98]
    Godau, M.: Personal communication (1998)Google Scholar
  8. [HS92]
    Hershberger, J., Snoeyink, J. S.: Speeding Up the Douglas-Peucker Line-Simplification Algorithm. Technical Report TR-92-07, Department of Computer Science, University of British Columbia, April (1992)Google Scholar
  9. [Ney98]
    Neyer, G.: Line Simplification with Restricted Orientations. Technical Report TR 311,, Department of Computer Science, ETH Zurich, Switzerland, (1998)Google Scholar
  10. [Wei97]
    Weibel, R.: Generalization of Spatial Data: Principles and Selected Algorithms. Lecture Notes in Computer Science, 1340, 99–152, (1997)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  1. 1.Institute for Theoretical Computer ScienceETH ZurichSwitzerland

Personalised recommendations