{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T10:37:04Z","timestamp":1770547024980,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,3,27]],"date-time":"2007-03-27T00:00:00Z","timestamp":1174953600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2007,9,24]]},"DOI":"10.1007\/s10707-007-0018-z","type":"journal-article","created":{"date-parts":[[2007,3,26]],"date-time":"2007-03-26T21:11:05Z","timestamp":1174943465000},"page":"497-513","source":"Crossref","is-referenced-by-count":12,"title":["Convergence Analysis and Quality Criteria for an Iterative Schematization of Networks"],"prefix":"10.1007","volume":"11","author":[{"given":"Silvania","family":"Avelar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,3,27]]},"reference":[{"issue":"3","key":"18_CR1","doi-asserted-by":"crossref","first-page":"217","DOI":"10.3138\/A477-3202-7876-N514","volume":"41","author":"S. Avelar","year":"2006","unstructured":"S. Avelar and L. Hurni. \u201cOn the design of schematic transport maps,\u201d Cartographica: The International Journal for Geographic Information and Geovisualization, Vol.\u00a041(3):217\u2013228, 2006.","journal-title":"Cartographica: The International Journal for Geographic Information and Geovisualization"},{"key":"18_CR2","unstructured":"S. Avelar and M. M\u00fcller. \u201cGenerating topologically correct schematic maps,\u201d in Proc. of 9th International Symposium on Spatial Data Handling, pp. 4a.28\u20134a.35, Beijing, 2000."},{"key":"18_CR3","unstructured":"S. Avelar. Schematic maps on demand: design, modeling and visualization, PhD Thesis no.14700, ETH Zurich, Switzerland, 2002."},{"key":"18_CR4","unstructured":"B.P. Bettig. A Graph\u2013based geometric problem solving system for mechanical design and manufacturing, PhD thesis, Department of Mechanical and Aerospace Engineering, Arizona State University, 1999."},{"key":"18_CR5","volume-title":"Graph Drawing","year":"1999","unstructured":"G.D. Battista, P. Eades, R. Tamassia, and I.G. Tollis, (eds.) Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999."},{"key":"18_CR6","first-page":"41","volume":"1849","author":"T. Barkowsky","year":"2000","unstructured":"T. Barkowsky, L.J. Latecki, and K.-K. Richter. \u201cSchematizing maps: simplification of geographic shape by discrete curve evolution,\u201d Lecture Notes in Artificial Intelligence. Spatial Cognition II, Vol.\u00a01849:41\u201353, 2000.","journal-title":"Lecture Notes in Artificial Intelligence. Spatial Cognition II"},{"key":"18_CR7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.comgeo.2004.11.002","volume":"30","author":"S. Cabello","year":"2005","unstructured":"S. Cabello, M. de\u00a0Berg, and M. van Kreveld. \u201cSchematization of networks,\u201d Computational Geometry. Theory and Applications, Vol.\u00a030:223\u2013238, 2005.","journal-title":"Computational Geometry. Theory and Applications"},{"issue":"2","key":"18_CR8","doi-asserted-by":"crossref","first-page":"112","DOI":"10.3138\/FM57-6770-U75U-7727","volume":"10","author":"D.H. Douglas","year":"1973","unstructured":"D.H. Douglas and T.K. Poicker (formerly Peucker). \u201cAlgorithms for the reduction of the number of points required to represent a line or its caricature,\u201d The Canadian Cartographer, Vol.\u00a010(2):112\u2013122, 1973.","journal-title":"The Canadian Cartographer"},{"key":"18_CR9","unstructured":"D. Elroi. \u201cDesigning a network line-map schematization software enhacement package,\u201d in Proc. of 8th Ann. ESRI User Conference, 1988."},{"key":"18_CR10","volume-title":"Algorithms for VLSI Design Automation","author":"S.H. Gerez","year":"1999","unstructured":"S.H. Gerez. Algorithms for VLSI Design Automation. Wiley, Chichester, England, 1999."},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"D.H. House and C.J. Kocmoud. \u201cContinuous cartogram construction,\u201d in 9th IEEE Visualization Conference, pp. 197\u2013204, North Carolina, October 1998.","DOI":"10.1109\/VISUAL.1998.745303"},{"issue":"1","key":"18_CR12","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1142\/S0129183198000108","volume":"9","author":"T. Kelly","year":"1998","unstructured":"T. Kelly and K. Nagel. \u201cRelaxation criteria for iterated traffic simulations,\u201d International Journal of Modern Physics C, Vol.\u00a09(1):113\u2013132, 1998.","journal-title":"International Journal of Modern Physics C"},{"issue":"2","key":"18_CR13","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s00453-001-0011-0","volume":"30","author":"M. Lonergan","year":"2001","unstructured":"M. Lonergan and C.B. Jones. \u201cAn iterative displacement method for conflict resolution in map generalization,\u201d Algorithmica, Vol.\u00a030(2):287\u2013301, 2001.","journal-title":"Algorithmica"},{"key":"18_CR14","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s101070050020","volume":"88","author":"Z.-Q. Luo","year":"2000","unstructured":"Z.-Q. Luo. \u201cNew error bounds and their applications to convergence analysis of iterative algorithms,\u201d Mathematical Programming, Series B, Vol.\u00a088:341\u2013356, 2000.","journal-title":"Mathematical Programming, Series B"},{"key":"18_CR15","volume-title":"How to Solve it: Modern Heuristics","author":"Z. Michalewicz","year":"1998","unstructured":"Z. Michalewicz and D.B. Fogel. How to Solve it: Modern Heuristics. Springer, Berlin, 1998."},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"G.\u00a0Neyer. Line simplification with restricted orientations, Technical Report 320, Department of Computer Science, ETH Zurich, Switzerland, 1999.","DOI":"10.1007\/3-540-48447-7_2"},{"issue":"1","key":"18_CR17","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1559\/152304099782424901","volume":"26","author":"A. Saalfeld","year":"1999","unstructured":"A.\u00a0Saalfeld. \u201cTopologically consistent line simplification with the Douglas\u2013Peucker algorithm,\u201d Cartography and Geographic Information Science, Vol.\u00a026(1):7\u201318, 1999.","journal-title":"Cartography and Geographic Information Science"},{"key":"18_CR18","unstructured":"R.C. Thomson and D.\u00a0E. Richardson. \u201cThe \u2019good continuation\u2019 principle of perceptual organization applied to the generalization of road networks,\u201d in Proc. of the 19th International Cartographic Conference, Ottawa, pp. 1215\u20131223, ICA, 1999."}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-007-0018-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-007-0018-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-007-0018-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:16:57Z","timestamp":1559254617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-007-0018-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,27]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,9,24]]}},"alternative-id":["18"],"URL":"https:\/\/doi.org\/10.1007\/s10707-007-0018-z","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,27]]}}}