{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:20:19Z","timestamp":1725664819927},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540624950"},{"type":"electronic","value":"9783540680482"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62495-3_55","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:38:54Z","timestamp":1330295934000},"page":"286-302","source":"Crossref","is-referenced-by-count":10,"title":["Proximity drawings of outerplanar graphs (extended abstract)"],"prefix":"10.1007","author":[{"given":"William","family":"Lenhart","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"H. Alt, M. Godau, and S. H. Whitesides. Universal 3-dimensional visibility representations for graphs. In Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes in Computer Science, pages 8\u201319. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021785"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"P. Bose, G. Di Battista, W. Lenhart, and G. Liotta. Proximity constraints and representable trees. In Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes in Computer Science. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-58950-3_389"},{"key":"23_CR3","unstructured":"P. Bose, W. Lenhart, and G. Liotta. Characterizing proximity trees. Technical Report TR-SOCS 93.9, School of Computer Science, McGill University, 1993."},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"M. Chroback, M. T. Goodrich, and R. Tamassia. Convex drawings of graphs in two and three dimensions. In Proc. 12th Annu. ACM Sympos. on Computational Geometry, pages 319\u2013328, 1996.","DOI":"10.1145\/237218.237401"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"G. Di Battista, W. Lenhart, and G. Liotta. Proximity drawability: A survey. In Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes in Computer Science. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-58950-3_388"},{"key":"23_CR6","unstructured":"G. Di Battista and G. Liotta. Computing proximity drawings of trees in 3-d space. In WADS (Proc. WADS '95). Springer-Verlag, 1995."},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"G. Di Battista, G. Liotta, and S. H. Whitesides. The strength of weak proximity. In Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes in Computer Science, pages 178\u2013189. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021802"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"P. Bades and P. Garvau. Drawing stressed planar graphs in three dimensions. In Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes in Computer Science, pages 212\u2013223. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021805"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"P. Eades and S. H. Whitesides. The realization problem for euclidean minimum spanning trees is np-hard. In Proc. ACM Symp. on Comp. Geom., 1994.","DOI":"10.1145\/177424.177507"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"S. Fekete, M. Houle, and S. H. Whitesides. New results on a visibility representation of graphs in 3d. In Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes in Computer Science, pages 234\u2013241. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021807"},{"key":"23_CR11","doi-asserted-by":"crossref","first-page":"54","DOI":"10.2307\/2412323","volume":"18","author":"K. R. Gabriel","year":"1969","unstructured":"K. R. Gabriel and R. R. Sokal. A new statistical approach to geographical analysis. Systematic Zoology, 18:54\u201364, 1969.","journal-title":"Systematic Zoology"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"J. W. Jaromczyk and G. T. Toussaint. Relative neighborhood graphs and their relatives. In Proceedings of the IEEE, 80, pages 1502\u20131517, 1992.","DOI":"10.1109\/5.163414"},{"key":"23_CR13","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/B978-0-444-87806-9.50013-X","volume-title":"Computational Geometry","author":"D. G. Kirkpatrick","year":"1985","unstructured":"D. G. Kirkpatrick and J. D. Radke. A framework for computational morphology. In G. T. Toussaint, editor, Computational Geometry, pages 217\u2013248. Elsevier, Amsterdam, 1985."},{"issue":"12","key":"23_CR14","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0020-0190(96)00012-9","volume":"6","author":"W. Lenhart","year":"1996","unstructured":"W. Lenhart and G. Liotta. Drawing outerplanar minimum weight triangulations. Inform. Process. Lett., 6(12):253\u2013260, 1996.","journal-title":"Inform. Process. Lett."},{"key":"23_CR15","unstructured":"A. Lubiw and N. Sleumer. All maximal outerplanar graphs are relative neighborhood graphs. In Proc. Fifth CCCG, pages 198\u2013203, 1993."},{"issue":"3","key":"23_CR16","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1111\/j.1538-4632.1980.tb00031.x","volume":"12","author":"D. W. Matula","year":"1980","unstructured":"D. W. Matula and R. R. Sokal. Properties of gabriel graphs relevant to geographic variation research and the clustering of points in the plane. Geographical Analysis, 12(3):205\u2013222, 1980.","journal-title":"Geographical Analysis"},{"key":"23_CR17","volume-title":"Master's thesis","author":"N. Sleumer","year":"1993","unstructured":"N. Sleumer. Oterplanar graphs as proximity graphs. Master's thesis, University of Waterloo, Watreloo, Canada, 1993."},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0031-3203(80)90062-X","volume":"12","author":"G. Toussaint","year":"1980","unstructured":"G. Toussaint. The relative neighborhood graph of a finite planar set. Pattern Recognition, 12:229\u2013260, 1980.","journal-title":"Pattern Recognition"},{"key":"23_CR19","unstructured":"W. T, Tutte. Connectivity in Graphs. Oxford University Press, 1972."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62495-3_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:12:54Z","timestamp":1605647574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62495-3_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540624950","9783540680482"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-62495-3_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}