{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T07:02:47Z","timestamp":1743663767804},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540314257"},{"type":"electronic","value":"9783540316671"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11618058_40","type":"book-chapter","created":{"date-parts":[[2006,1,20]],"date-time":"2006-01-20T09:56:50Z","timestamp":1137751010000},"page":"446-457","source":"Crossref","is-referenced-by-count":15,"title":["Incremental Connector Routing"],"prefix":"10.1007","author":[{"given":"Michael","family":"Wybrow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim","family":"Marriott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","unstructured":"The Omni Group: OmniGraffle Product Page. Web Page (2002), \n                    \n                      http:\/\/www.omnigroup.com\/omnigraffle\/"},{"key":"40_CR2","unstructured":"Larsson, A.: Dia Home Page. Web Page (2002), \n                    \n                      http:\/\/www.gnome.org\/projects\/dia\/"},{"key":"40_CR3","unstructured":"Microsoft Corporation: Microsoft Visio Home Page. Web Page (2002), \n                    \n                      http:\/\/office.microsoft.com\/visio\/"},{"key":"40_CR4","unstructured":"Computer Systems Odessa: ConceptDraw Home Page. Web Page (2002), \n                    \n                      http:\/\/www.conceptdraw.com\/"},{"key":"40_CR5","unstructured":"yWorks: yFiles - Java Graph Layout and Visualization Library. Web Page (2005), \n                    \n                      www.yworks.com\/products\/yfiles\/"},{"key":"40_CR6","unstructured":"AT&T Research: Spline-o-matic library. Web Page (1999), \n                    \n                      http:\/\/www.graphviz.org\/Misc\/spline-o-matic\/"},{"key":"40_CR7","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1109\/CASE.1993.634832","volume-title":"Proceedings of the Sixth International Workshop on Computer-Aided Software Engineering","author":"K. Miriyala","year":"1993","unstructured":"Miriyala, K., Hornick, S.W., Tamassia, R.: An incremental approach to aesthetic graph layout. In: Proceedings of the Sixth International Workshop on Computer-Aided Software Engineering, pp. 297\u2013308. IEEE Computer Society, Los Alamitos (1993)"},{"key":"40_CR8","unstructured":"Lee, D.T.: Proximity and reachability in the plane. PhD thesis, Department of Electrical Engineering, University of Illinois, Urbana, IL (1978)"},{"key":"40_CR9","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0020-0190(85)90044-4","volume":"20","author":"E. Welzl","year":"1985","unstructured":"Welzl, E.: Constructing the visibility graph for n line segments in O(n\n                           2) time. Information Processing Letters\u00a020, 167\u2013171 (1985)","journal-title":"Information Processing Letters"},{"key":"40_CR10","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF01840436","volume":"1","author":"T. Asano","year":"1986","unstructured":"Asano, T., Asano, T., Guibas, L., Hershberger, J., Imai, H.: Visibility of disjoint polygons. Algorithmica\u00a01, 49\u201363 (1986)","journal-title":"Algorithmica"},{"key":"40_CR11","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1145\/73393.73410","volume-title":"Proceedings of the fourth annual symposium on Computational geometry","author":"M.H. Overmars","year":"1988","unstructured":"Overmars, M.H., Welzl, E.: New methods for computing visibility graphs. In: Proceedings of the fourth annual symposium on Computational geometry, pp. 164\u2013171. ACM Press, New York (1988)"},{"key":"40_CR12","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1137\/0220055","volume":"20","author":"S.K. Ghosh","year":"1991","unstructured":"Ghosh, S.K., Mount, D.M.: An output-sensitive algorithm for computing visibility. SIAM Journal on Computing\u00a020, 888\u2013910 (1991)","journal-title":"SIAM Journal on Computing"},{"key":"40_CR13","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM\u00a034, 596\u2013615 (1987)","journal-title":"J. ACM"},{"key":"40_CR14","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/B978-044482537-7\/50016-4","volume-title":"Handbook of Computational Geometry","author":"J.S. Mitchell","year":"2000","unstructured":"Mitchell, J.S.: Geometric shortest paths and network optimization. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 633\u2013701. Elsevier Science Publishers B.V., Amsterdam (2000)"},{"key":"40_CR15","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0020-0190(86)90045-1","volume":"23","author":"H. Rohnert","year":"1986","unstructured":"Rohnert, H.: Shortest paths in the plane with convex polygonal obstacles. Information Processing Letters\u00a023, 71\u201376 (1986)","journal-title":"Information Processing Letters"},{"key":"40_CR16","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/997817.997825","volume-title":"SCG 2004: Proceedings of the twentieth annual symposium on Computational geometry","author":"B. Ben-Moshe","year":"2004","unstructured":"Ben-Moshe, B., Hall-Holt, O., Katz, M.J., Mitchell, J.S.B.: Computing the visibility graph of points within a polygon. In: SCG 2004: Proceedings of the twentieth annual symposium on Computational geometry, pp. 27\u201335. ACM Press, New York (2004)"},{"key":"40_CR17","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Numerische Mathematik, 269\u2013271 (1959)","DOI":"10.1007\/BF01386390"},{"key":"40_CR18","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1145\/15922.15908","volume-title":"SIGGRAPH 1986: Proceedings of the 13th annual conference on Computer graphics and interactive techniques","author":"R.C. Nelson","year":"1986","unstructured":"Nelson, R.C., Samet, H.: A consistent hierarchical representation for vector data. In: SIGGRAPH 1986: Proceedings of the 13th annual conference on Computer graphics and interactive techniques, pp. 197\u2013206. ACM Press, New York (1986)"},{"key":"40_CR19","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/MC.1983.1654471","volume":"16","author":"B. Shneiderman","year":"1983","unstructured":"Shneiderman, B.: Direct manipulation: A step beyond programming languages. IEEE Computer\u00a016, 57\u201369 (1983)","journal-title":"IEEE Computer"},{"key":"40_CR20","unstructured":"Woodberry, O.J.: Knowledge engineering a Bayesian network for an ecological risk assessment. Honours thesis, Monash University, CSSE, Australia (2003), \n                    \n                      http:\/\/www.csse.monash.edu.au\/hons\/projects\/2003\/Owen.Woodberry\/"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11618058_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:12:20Z","timestamp":1619507540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11618058_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314257","9783540316671"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11618058_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}