{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T11:44:55Z","timestamp":1747136695043},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540639381"},{"type":"electronic","value":"9783540696742"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63938-1_47","type":"book-chapter","created":{"date-parts":[[2006,7,18]],"date-time":"2006-07-18T11:35:47Z","timestamp":1153222547000},"page":"25-36","source":"Crossref","is-referenced-by-count":9,"title":["On embedding an outer-planar graph in a point set"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"P. Bose, G. Di Battista, W. Lenhart, and G. Liotta. Proximity constraints and representable trees. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes in Computer Science, pages 340\u2013351. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-58950-3_389"},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02086609","volume":"16","author":"P. Bose","year":"1996","unstructured":"P. Bose, W. Lenhart, and G. Liotta. Characterizing proximity trees. Algorithmica, 16:83\u2013110, 1996.","journal-title":"Algorithmica"},{"key":"3_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"J.A. Bondy and U.S.R. Murty. Graph Theory with Applications. Elsevier Science, New York, NY, 1976."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"P. Bose, M. McAllister, and J. Snoeyink. Optimal algorithms to embed trees in a point set. Journal of Graph Algorithms and Applications, to appear. Also appears in Proceedings of Graph Drawing GD'95, LNCS 1027, pp. 64\u201375, 1995.","DOI":"10.1007\/BFb0021791"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/TIT.1985.1057060","volume":"IT-31","author":"B. Chazelle","year":"1985","unstructured":"B. Chazelle. On the convex layers of a planar set. IEEE Trans. on Inf. Theory, IT-31:509\u2013517, 1985.","journal-title":"IEEE Trans. on Inf. Theory"},{"key":"3_CR6","volume-title":"Introduction to algorithms","author":"T. Cormen","year":"1990","unstructured":"T. Cormen, C. Leiserson, and R. Rivest. Introduction to algorithms. MIT Press, Cambridge, Mass., 1990."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"P. Crescenzi and A. Piperno. Optimal-area upward drawings of AVL trees. In R. Tamassia and 1. G. Tollis, editors, Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes in Computer Science, pages 307\u2013317. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-58950-3_386"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"N. Castaneda and J. Urrutia. Straight line embeddings of planar graphs on point sets. In Proc. Eighth Canadian Conf. on Comp. Geom., pages 312\u2013318, 1996.","DOI":"10.1515\/9780773591134-055"},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. Battista Di","year":"1994","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis.Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4:235\u2013282, 1994.","journal-title":"Comput. Geom. Theory Appl."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"P. Eades and S. Whitesides. The realization problem for Euclidean minimum spanning trees is NP-hard. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 49\u201356, 1994.","DOI":"10.1145\/177424.177507"},{"key":"3_CR11","first-page":"229","volume":"11","author":"I. Fary","year":"1948","unstructured":"I. Fary. On straight line representation of planar graphs. Acta Sci. Math. Szeged, 11:229\u2013233, 1948.","journal-title":"Acta Sci. Math. Szeged"},{"key":"3_CR12","doi-asserted-by":"crossref","first-page":"165","DOI":"10.2307\/2323956","volume":"98","author":"P. Gritzmann","year":"1991","unstructured":"P. Gritzmann, B. Mohar, J. Pach, and R. Pollack. Embedding a planar triangulation with vertices at specified points (solution to problem e3341. American Mathematical Monthly, 98:165\u2013166, 1991.","journal-title":"American Mathematical Monthly"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01994880","volume":"32","author":"J. Hershberger","year":"1992","unstructured":"John Hershberger and Subhash Suri. Applications of a semi-dynamic convex hull algorithm. BIT, 32:249\u2013267, 1992.","journal-title":"BIT"},{"key":"3_CR14","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF02573994","volume":"11","author":"Y. Ikebe","year":"1994","unstructured":"Y. Ikebe, M. Perles, A. Tamura, and S. Tokunaga. The rooted tree embedding problem into points in the plane. Discrete & Computational Geometry, 11:51\u201363, 1994.","journal-title":"Discrete & Computational Geometry"},{"key":"3_CR15","unstructured":"G. Kant, G. Liotta, R. Tamassia, and I. Tollis. Area requirement of visibility representations of trees. In Proc. 5th Canad. Conf. Comput. Geom., pages 192\u2013197, Waterloo, Canada, 1993."},{"key":"3_CR16","first-page":"159","volume":"64","author":"J. Manning","year":"1988","unstructured":"J. Manningand M. J. Atallah. Fast detection and display of symmetry in trees. Congressus Numerantium, 64:159\u2013169, 1988.","journal-title":"Congressus Numerantium"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"C. Monma and S. Suri. Transitions in geometric minimum spanning trees. In Proc. 7th Annu. ACM Sympos. Comput. Geom., pages 239\u2013249, 1991.","DOI":"10.1145\/109648.109675"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","volume":"23","author":"M. Overmars","year":"1981","unstructured":"M. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. Journal of Computer and System Sciences, 23:166\u2013204, 1981.","journal-title":"Journal of Computer and System Sciences"},{"key":"3_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: an Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry: an Introduction. Springer-Verlag, New York, NY, 1985."},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"J\u00e1nos Pach and Jen\u0151 T\u0151r\u0151csik. Layout of rooted trees. In W. T. Trotter, editor, Planar Graphs, volume 9 of DIMACS Series, pages 131\u2013137. American Mathematical Society, 1993.","DOI":"10.1090\/dimacs\/009\/11"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63938-1_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,5]],"date-time":"2024-02-05T11:19:23Z","timestamp":1707131963000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63938-1_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540639381","9783540696742"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-63938-1_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}