{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:37Z","timestamp":1725664537278},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602200"},{"type":"electronic","value":"9783540447474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60220-8_66","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:52:27Z","timestamp":1330278747000},"page":"239-250","source":"Crossref","is-referenced-by-count":10,"title":["Computing proximity drawings of trees in the 3-dimensional space"],"prefix":"10.1007","author":[{"given":"G.","family":"Liotta","sequence":"first","affiliation":[]},{"given":"G.","family":"Battista","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"21_CR1","unstructured":"Advanced Visual Interfaces, Proccedings of the Workshop AVI'92, edited by T. Catarci, M.F. Costabile, and S. Levialdi, World Scientific series in Computer Science, Vol. 36, 1992."},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"P. Bose, G. Di Battista, W. Lenhart, and G. Liotta. Proximity Constraints and Representable Trees. Proc. Graph Drawing'94, LNCS, pp. 340\u2013351, Princeton, NJ, 1994.","DOI":"10.1007\/3-540-58950-3_389"},{"key":"21_CR3","unstructured":"P. Bose, W. Lenhart, and G. Liotta. Characterizing Proximity Trees. To appear in Algorithmica: Special Issue on Graph Drawing."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"R. Cohen, P. Eades, T. Lin, and F. Ruskey. Three-Dimensional Graph Drawing. Proc. Graph Drawing'94, LNCS, pp. 1\u20131, Princeton, NJ, 1994.","DOI":"10.1007\/3-540-58950-3_351"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"J.H. Conway, N.J.A. Sloane. Sphere Packings, Lattices, and Groups, Springer Verlag, 1993.","DOI":"10.1007\/978-1-4757-2249-9"},{"issue":"5","key":"21_CR6","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 Automatic Graph Drawing: An Annotated Bibliography. Computational Geometry: Theory and Applications, 4, 5, 1994, pp. 235\u2013282.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"G. Di Battista, W. Lenhart, and G. Liotta. Proximity Drawability: a Survey. Proc. Graph Drawing'94, LNCS, pp. 328\u2013339, Princeton, NJ, 1994.","DOI":"10.1007\/3-540-58950-3_388"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"P. Eades and S. Whitesides. The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard. Proc. ACM Symposium on Computational Geometry, 1994, pp. 49\u201356.","DOI":"10.1145\/177424.177507"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"H. ElGindy, G. Liotta, A. Lubiw, H. Meijer, and S.H. Whitesides. Recognizing Rectangle of Influence Drawable Graphs. Proc. Graph Drawing'94, LNCS, pp. 352\u2013363, Princeton, NJ, 1994.","DOI":"10.1007\/3-540-58950-3_390"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"1502","DOI":"10.1109\/5.163414","volume":"80","author":"J. W. Jaromczyk","year":"1992","unstructured":"J. W. Jaromczyk and G. T. Toussaint. Relative Neighborhood Graphs and Their Relatives. Proceedings of the IEEE, 80, 1992, pp. 1502\u20131517.","journal-title":"Proceedings of the IEEE"},{"key":"21_CR11","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. Computational Geometry, G. T. Toussaint, Elsevier, Amsterdam, 1985, pp. 217\u2013248."},{"key":"21_CR12","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. L. Lawler","year":"1976","unstructured":"E. L. Lawler. Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976."},{"key":"21_CR13","doi-asserted-by":"crossref","first-page":"22","DOI":"10.2307\/3610264","volume":"40","author":"J. Leech","year":"1956","unstructured":"J. Leech. The Problem of the Thirteen Spheres. The Mathematical Gazette, 40, 1956, pp. 22\u201323.","journal-title":"The Mathematical Gazette"},{"key":"21_CR14","volume-title":"Ph.D Thesis","author":"G. Liotta","year":"1995","unstructured":"G. Liotta. Computing Proximity Drawings of Graphs. Ph.D Thesis, University of Rome \u201cLa Sapienza\u201d, 1995."},{"key":"21_CR15","unstructured":"A. Lubiw, and N. Sleumer, All Maximal Outerplanar Graphs are Relative Neighborhood Graphs. Proc. CCCG '93, 1993, pp. 198\u2013203."},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"C. Monma and S. Suri. Transitions in Geometric Minimum Spanning Trees. Proc. ACM Symposium on Computational Geometry, 1991, pp. 239\u2013249.","DOI":"10.1145\/109648.109675"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"S. P. Reiss. 3-D Visualization of Program Information. Proc. Graph Drawing'94, LNCS, pp. 12\u201324, Princeton, NJ, 1994","DOI":"10.1007\/3-540-58950-3_352"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60220-8_66.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:56:10Z","timestamp":1605646570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60220-8_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602200","9783540447474"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-60220-8_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}