Skip to main content
SpringerLink
Log in

Convergence Analysis and Quality Criteria for an Iterative Schematization of Networks

  • Published:
GeoInformatica Aims and scope Submit manuscript

Abstract

Schematic networks are linear abstractions of functional networks, such as route networks. Lines in the original network are modified in order to produce a schematic network which satisfies a set of constraints chosen to design the network. A method is described which accomplishes this line transformation using an iterative improvement technique driven by design constraints. The method maintains topological characteristics of the network by the use of simple geometric operations and tests. The iterative process can be repeated until the line displacements become small enough or until it meets user defined stopping criteria. Experimental results are provided to examine the acceptability of outcomes and the convergence of the applied iterative technique. Criteria for measuring the quality of results, as well as for stopping the iterative approach are presented.

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

Similar content being viewed by others

References

  1. S. Avelar and L. Hurni. “On the design of schematic transport maps,” Cartographica: The International Journal for Geographic Information and Geovisualization, Vol. 41(3):217–228, 2006.

    Article  Google Scholar 

  2. S. Avelar and M. Müller. “Generating topologically correct schematic maps,” in Proc. of 9th International Symposium on Spatial Data Handling, pp. 4a.28–4a.35, Beijing, 2000.

  3. S. Avelar. Schematic maps on demand: design, modeling and visualization, PhD Thesis no.14700, ETH Zurich, Switzerland, 2002.

  4. B.P. Bettig. A Graph–based geometric problem solving system for mechanical design and manufacturing, PhD thesis, Department of Mechanical and Aerospace Engineering, Arizona State University, 1999.

  5. G.D. Battista, P. Eades, R. Tamassia, and I.G. Tollis, (eds.) Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999.

    Google Scholar 

  6. T. Barkowsky, L.J. Latecki, and K.-K. Richter. “Schematizing maps: simplification of geographic shape by discrete curve evolution,” Lecture Notes in Artificial Intelligence. Spatial Cognition II, Vol. 1849:41–53, 2000.

    Google Scholar 

  7. S. Cabello, M. de Berg, and M. van Kreveld. “Schematization of networks,” Computational Geometry. Theory and Applications, Vol. 30:223–238, 2005.

    Google Scholar 

  8. D.H. Douglas and T.K. Poicker (formerly Peucker). “Algorithms for the reduction of the number of points required to represent a line or its caricature,” The Canadian Cartographer, Vol. 10(2):112–122, 1973.

    Google Scholar 

  9. D. Elroi. “Designing a network line-map schematization software enhacement package,” in Proc. of 8th Ann. ESRI User Conference, 1988.

  10. S.H. Gerez. Algorithms for VLSI Design Automation. Wiley, Chichester, England, 1999.

    Google Scholar 

  11. D.H. House and C.J. Kocmoud. “Continuous cartogram construction,” in 9th IEEE Visualization Conference, pp. 197–204, North Carolina, October 1998.

  12. T. Kelly and K. Nagel. “Relaxation criteria for iterated traffic simulations,” International Journal of Modern Physics C, Vol. 9(1):113–132, 1998.

    Article  Google Scholar 

  13. M. Lonergan and C.B. Jones. “An iterative displacement method for conflict resolution in map generalization,” Algorithmica, Vol. 30(2):287–301, 2001.

    Article  Google Scholar 

  14. Z.-Q. Luo. “New error bounds and their applications to convergence analysis of iterative algorithms,” Mathematical Programming, Series B, Vol. 88:341–356, 2000.

    Article  Google Scholar 

  15. Z. Michalewicz and D.B. Fogel. How to Solve it: Modern Heuristics. Springer, Berlin, 1998.

    Google Scholar 

  16. G. Neyer. Line simplification with restricted orientations, Technical Report 320, Department of Computer Science, ETH Zurich, Switzerland, 1999.

  17. A. Saalfeld. “Topologically consistent line simplification with the Douglas–Peucker algorithm,” Cartography and Geographic Information Science, Vol. 26(1):7–18, 1999.

    Google Scholar 

  18. R.C. Thomson and D. E. Richardson. “The ’good continuation’ principle of perceptual organization applied to the generalization of road networks,” in Proc. of the 19th International Cartographic Conference, Ottawa, pp. 1215–1223, ICA, 1999.

Download references

Author information

Authors and Affiliations

  1. Empa, Swiss Federal Laboratories for Materials Testing and Research, Lerchenfeldstr. 5, CH-9014, St.Gallen, Switzerland

    Silvania Avelar

Authors
  1. Silvania Avelar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Silvania Avelar.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Avelar, S. Convergence Analysis and Quality Criteria for an Iterative Schematization of Networks. Geoinformatica 11, 497–513 (2007). https://doi.org/10.1007/s10707-007-0018-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10707-007-0018-z

Keywords

Search

Navigation