{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T06:51:59Z","timestamp":1726469519357},"reference-count":27,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2014,4,1]],"date-time":"2014-04-01T00:00:00Z","timestamp":1396310400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,4,1]],"date-time":"2018-04-01T00:00:00Z","timestamp":1522540800000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"name":"KIT"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1016\/j.comgeo.2013.10.002","type":"journal-article","created":{"date-parts":[[2013,10,11]],"date-time":"2013-10-11T15:51:05Z","timestamp":1381506665000},"page":"381-406","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"special_numbering":"PA","title":["On d -regular schematization of embedded paths"],"prefix":"10.1016","volume":"47","author":[{"given":"Daniel","family":"Delling","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Gemsa","sequence":"additional","affiliation":[]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Pajor","sequence":"additional","affiliation":[]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.comgeo.2013.10.002_br0010","series-title":"Proc. 12th Scandinavian Symposium & Workshops on Algorithm Theory (SWAT\u02bc10)","first-page":"285","article-title":"Path schematization for route sketches","volume":"vol. 6139","author":"Delling","year":"2010"},{"key":"10.1016\/j.comgeo.2013.10.002_br0020","series-title":"Proc. 37th Int. Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM\u02bc11)","first-page":"260","article-title":"On d-regular schematization of embedded paths","volume":"vol. 6543","author":"Gemsa","year":"2011"},{"key":"10.1016\/j.comgeo.2013.10.002_br0030","series-title":"Proc. 17th Ann. ACM Symposium on Computational Geometry (SoCG\u02bc01)","first-page":"33","article-title":"Schematization of road networks","author":"Cabello","year":"2001"},{"key":"10.1016\/j.comgeo.2013.10.002_br0040","series-title":"Proc. 10th Int. Symposium on Graph Drawing (GD\u02bc02)","first-page":"1","article-title":"Sketch-driven orthogonal graph drawing","volume":"vol. 2528","author":"Brandes","year":"2002"},{"key":"10.1016\/j.comgeo.2013.10.002_br0050","series-title":"Drawing Graphs: Methods and Models","first-page":"228","article-title":"Dynamic graph drawing","volume":"vol. 2025","author":"Branke","year":"2001"},{"issue":"2","key":"10.1016\/j.comgeo.2013.10.002_br0060","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","article-title":"Layout adjustment and the mental map","volume":"6","author":"Misue","year":"1995","journal-title":"J. Vis. Lang. Comput."},{"key":"10.1016\/j.comgeo.2013.10.002_br0070","series-title":"Proc. 6th Int. Symposium on Graph Drawing (GD\u02bc98)","first-page":"183","article-title":"A layout adjustment problem for disjoint rectangles preserving orthogonal order","volume":"vol. 1547","author":"Hayashi","year":"1998"},{"key":"10.1016\/j.comgeo.2013.10.002_br0080","series-title":"Proc. 13th Int. Symposium on Graph Drawing (GD\u02bc05)","first-page":"141","article-title":"Stress majorization with orthogonal ordering constraints","volume":"vol. 3843","author":"Dwyer","year":"2006"},{"key":"10.1016\/j.comgeo.2013.10.002_br0090","series-title":"Proc. 16th Int. Symposium on Graph Drawing (GD\u02bc08)","first-page":"266","article-title":"On the hardness of orthogonal-order preserving graph drawing","volume":"vol. 5417","author":"Brandes","year":"2009"},{"issue":"2","key":"10.1016\/j.comgeo.2013.10.002_br0100","doi-asserted-by":"crossref","first-page":"112","DOI":"10.3138\/FM57-6770-U75U-7727","article-title":"Algorithms for the reduction of the number of points required to represent a digitized line or its caricature","volume":"10","author":"Douglas","year":"1973","journal-title":"Cartographica"},{"key":"10.1016\/j.comgeo.2013.10.002_br0110","series-title":"Proc. 14th Int. Symposium on Graph Drawing (GD\u02bc06)","first-page":"258","article-title":"Path simplification for metro map layout","volume":"vol. 4372","author":"Merrick","year":"2007"},{"key":"10.1016\/j.comgeo.2013.10.002_br0120","series-title":"Proc. 6th Int. Workshop on Algorithms and Data Structures (WADS\u02bc99)","first-page":"13","article-title":"Line simplification with restricted orientations","volume":"vol. 1663","author":"Neyer","year":"1999"},{"key":"10.1016\/j.comgeo.2013.10.002_br0130","series-title":"Proc. 28th Ann. Conference on Computer Graphics and Interactive Techniques (SIGGRAPH\u02bc01)","first-page":"241","article-title":"Rendering effective route maps: Improving usability through generalization","author":"Agrawala","year":"2001"},{"issue":"6","key":"10.1016\/j.comgeo.2013.10.002_br0140","doi-asserted-by":"crossref","first-page":"158:1","DOI":"10.1145\/1882261.1866184","article-title":"Automatic generation of destination maps","volume":"29","author":"Kopf","year":"2010","journal-title":"ACM Trans. Graph."},{"year":"2005","series-title":"Automated drawing of metro maps","author":"N\u00f6llenburg","key":"10.1016\/j.comgeo.2013.10.002_br0150"},{"issue":"5","key":"10.1016\/j.comgeo.2013.10.002_br0160","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1109\/TVCG.2010.81","article-title":"Drawing and labeling high-quality metro maps by mixed-integer programming","volume":"17","author":"N\u00f6llenburg","year":"2011","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"1","key":"10.1016\/j.comgeo.2013.10.002_br0170","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s00450-007-0036-y","article-title":"Drawing subway maps: A survey","volume":"22","author":"Wolff","year":"2007","journal-title":"Inform. Forsch. Entwickl."},{"issue":"1","key":"10.1016\/j.comgeo.2013.10.002_br0180","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00281","article-title":"Orthogonal-ordering constraints are tough","volume":"17","author":"Brandes","year":"2013","journal-title":"J. Graph Algorithms Appl."},{"key":"10.1016\/j.comgeo.2013.10.002_br0190","series-title":"LATIN 2010: Theoretical Informatics","first-page":"468","article-title":"Homotopic rectilinear routing with few links and thick edges","volume":"vol. 6034","author":"Speckmann","year":"2010"},{"key":"10.1016\/j.comgeo.2013.10.002_br0200","series-title":"Proc. 20th Int. Symposium on Graph Drawing (GD\u02bc12)","first-page":"272","article-title":"Homotopic C-oriented routing","author":"Verbeek","year":"2013"},{"key":"10.1016\/j.comgeo.2013.10.002_br0210","series-title":"Proc. 19th ACM SIGSPATIAL Int. Conference on Advances in Geographic Information Systems (GIS\u02bc11)","first-page":"261","article-title":"A new method for subdivision simplification with applications to urban-area generalization","author":"Buchin","year":"2011"},{"key":"10.1016\/j.comgeo.2013.10.002_br0220","series-title":"Proc. 6th Ann. Int. Conference on Computing and Combinatorics (COCOON 2010)","first-page":"216","article-title":"Optimal binary space partitions in the plane","volume":"vol. 6196","author":"Berg","year":"2010"},{"key":"10.1016\/j.comgeo.2013.10.002_br0230","series-title":"Proc. 30th Ann. Symposium on Foundations of Computer Science (FOCS\u02bc89)","first-page":"332","article-title":"Speeding-up linear programming using fast matrix multiplication","author":"Vaidya","year":"1989"},{"issue":"4","key":"10.1016\/j.comgeo.2013.10.002_br0240","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s00453-001-0049-z","article-title":"Exact algorithms for linear programming over algebraic extensions","volume":"31","author":"Beling","year":"2001","journal-title":"Algorithmica"},{"issue":"3","key":"10.1016\/j.comgeo.2013.10.002_br0250","doi-asserted-by":"crossref","first-page":"165","DOI":"10.2307\/2301023","article-title":"A note on trigonometric algebraic numbers","volume":"40","author":"Lehmer","year":"1933","journal-title":"Am. Math. Mon."},{"issue":"10","key":"10.1016\/j.comgeo.2013.10.002_br0260","doi-asserted-by":"crossref","first-page":"404","DOI":"10.2307\/2299031","article-title":"Discussions: Note on trigonometric functions","volume":"29","author":"Swift","year":"1922","journal-title":"Am. Math. Mon."},{"key":"10.1016\/j.comgeo.2013.10.002_br0270","series-title":"Proc. 14th Ann. ACM\u2013SIAM Symposium on Discrete Algorithms, SODA\u02bc03","first-page":"618","article-title":"Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time","author":"Mortensen","year":"2003"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772113001156?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772113001156?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,12]],"date-time":"2018-10-12T03:21:46Z","timestamp":1539314506000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772113001156"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["S0925772113001156"],"URL":"https:\/\/doi.org\/10.1016\/j.comgeo.2013.10.002","relation":{},"ISSN":["0925-7721"],"issn-type":[{"type":"print","value":"0925-7721"}],"subject":[],"published":{"date-parts":[[2014,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On d-regular schematization of embedded paths","name":"articletitle","label":"Article Title"},{"value":"Computational Geometry","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.comgeo.2013.10.002","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}