Skip to main content
SpringerLink
Log in

Simultaneous curve simplification

  • Original Article
  • Published:
Journal of Geographical Systems Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  • 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–364

  • Chew L (1987) Constrained delaunay triangulations. In: SCG’87: Proceedings of the third annual symposium on Computational geometry, ACM, New York, pp 215–222

  • 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–122

    Google Scholar 

  • Heckbert P, Garland M (1997) Survey on polygonal surface simplification algorithms. Technical report, Carnegie Mellon University, Multiresolution Surface Modeling Course, SIGGRAPH’97

  • Hjelle Ø, Dæhlen M (2006) Triangulations and applications. Springer, Berlin

    Google Scholar 

  • Lee D, Lin A (1986) Generalized delaunay triangulation for planar graphs. Discret Comput Geom 1:201–217

    Article  Google Scholar 

  • Nielson G (1997) Tools for triangulations and tetrahedrizations and constructing functions defined over them. CS Press, Washington, pp 429–525

    Google Scholar 

  • Ramer U (1972) An iterative procedure for the polygonal approximation of plane curves. Comput Graphics Image Process 1:244–256

    Article  Google Scholar 

  • US Geological Survey (1997) Lake Tahoe data clearinghouse website. http://tahoe.usgs.gov

Download references

Author information

Authors and Affiliations

  1. SINTEF ICT Applied Mathematics, P.O. Box 124, Blindern, 0314, Oslo, Norway

    Christopher Dyken

  2. Department of Informatics, University of Oslo, P.O. Box 1080, Blindern, 0316, Oslo, Norway

    Morten Dæhlen

  3. World Beside AS, Gaustadalléen 25, 0373, Oslo, Norway

    Thomas Sevaldrud

Authors
  1. Christopher Dyken
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Morten Dæhlen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Thomas Sevaldrud
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christopher Dyken.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dyken, C., Dæhlen, M. & Sevaldrud, T. Simultaneous curve simplification. J Geogr Syst 11, 273–289 (2009). https://doi.org/10.1007/s10109-009-0078-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10109-009-0078-8

Keywords

JEL

Search

Navigation