Journal of Geographical Systems

, Volume 11, Issue 3, pp 273–289 | Cite as

Simultaneous curve simplification

  • Christopher Dyken
  • Morten Dæhlen
  • Thomas Sevaldrud
Original Article

Abstract

In this paper we present a method for simultaneous simplification of a collection of piecewise linear curves in the plane. The method is based on triangulations, and the main purpose is to remove line segments from the piecewise linear curves without changing the topological relations between the curves. The method can also be used to construct a multi-level representation of a collection of piecewise linear curves. We illustrate the method by simplifying cartographic contours and a set of piecewise linear curves representing a road network.

Keywords

Simplification Digital line graph Multi-resolution Triangulation 

JEL

C63 

References

  1. Arge E, Dæhlen M (1997) Data reduction of piecewise linear curves. In: Tveito A, Dæhlen M (eds) Numerical methods and software tools in industrial mathematics, Birkhauser, Boston, pp 347–364Google Scholar
  2. Chew L (1987) Constrained delaunay triangulations. In: SCG’87: Proceedings of the third annual symposium on Computational geometry, ACM, New York, pp 215–222Google Scholar
  3. Douglas D, Peucker T (1973) Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Can Cartogr 10(2):112–122Google Scholar
  4. Heckbert P, Garland M (1997) Survey on polygonal surface simplification algorithms. Technical report, Carnegie Mellon University, Multiresolution Surface Modeling Course, SIGGRAPH’97Google Scholar
  5. Hjelle Ø, Dæhlen M (2006) Triangulations and applications. Springer, BerlinGoogle Scholar
  6. Lee D, Lin A (1986) Generalized delaunay triangulation for planar graphs. Discret Comput Geom 1:201–217CrossRefGoogle Scholar
  7. Nielson G (1997) Tools for triangulations and tetrahedrizations and constructing functions defined over them. CS Press, Washington, pp 429–525Google Scholar
  8. Ramer U (1972) An iterative procedure for the polygonal approximation of plane curves. Comput Graphics Image Process 1:244–256CrossRefGoogle Scholar
  9. US Geological Survey (1997) Lake Tahoe data clearinghouse website. http://tahoe.usgs.gov

Copyright information

© Springer-Verlag 2009

Authors and Affiliations

  • Christopher Dyken
    • 1
  • Morten Dæhlen
    • 2
  • Thomas Sevaldrud
    • 3
  1. 1.SINTEF ICT Applied MathematicsOsloNorway
  2. 2.Department of InformaticsUniversity of OsloOsloNorway
  3. 3.World Beside ASOsloNorway

Personalised recommendations