{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:34:02Z","timestamp":1725489242948},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540669043"},{"type":"electronic","value":"9783540466482"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46648-7_38","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T08:29:28Z","timestamp":1186907368000},"page":"369-378","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Voronoi Drawings of Trees"],"prefix":"10.1007","author":[{"given":"Giuseppe","family":"Liotta","sequence":"first","affiliation":[]},{"given":"Henk","family":"Meijer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,3,3]]},"reference":[{"issue":"3","key":"38_CR1","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F. Aurenhammer","year":"1991","unstructured":"F. Aurenhammer. Voronoi diagrams: A survey of a fundamental geometric data stru cture. ACM Comput. Surv., 23(3):345\u2013405, Sept. 1991.","journal-title":"ACM Comput. Surv."},{"key":"38_CR2","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999."},{"doi-asserted-by":"crossref","unstructured":"G. Di Battista, W. Lenhart, and G. Liotta. Proximity drawability: a survey. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD\u2019 94), volume 894 of Lecture Notes Comput. Sci., pages 328\u2013339. Springer-Verlag, 1995.","key":"38_CR3","DOI":"10.1007\/3-540-58950-3_388"},{"issue":"6","key":"38_CR4","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0020-0190(90)90210-O","volume":"33","author":"M. B. Dillencourt","year":"1990","unstructured":"M. B. Dillencourt. Realizability of Delaunay triangulations. Inform. Process. Lett., 33(6):283\u2013287, Feb. 1990.","journal-title":"Inform. Process. Lett."},{"key":"38_CR5","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF02187810","volume":"5","author":"M. B. Dillencourt","year":"1990","unstructured":"M. B. Dillencourt. Toughness and Delaunay triangulations. Discrete Comput. Geom., 5:575\u2013601, 1990.","journal-title":"Discrete Comput. Geom."},{"unstructured":"M. B. Dillencourt and W. D. Smith. Graph-theoretical conditions for inscribability and Delaunayr ealizability. In Proc. 6th Canad. Conf. Comput. Geom., pages 287\u2013292, 1994.","key":"38_CR6"},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/BF02086608","volume":"16","author":"P. Eades","year":"1996","unstructured":"P. Eades and S. Whitesides. The realization problem for Euclidean minimum spanning trees is NP-hard. Algorithmica, 16:60\u201382, 1996. (special issue on Graph Drawing, edited by G. Di Battista and R. Tamassia).","journal-title":"Algorithmica"},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-60220-8_66","volume":"955","author":"G. Liotta","year":"1995","unstructured":"G. Liotta and G. Di Battista. Computing proximity drawings of trees in the 3-dimensional space. In Proc. 4th Workshop Algorithms Data Struct., volume 955 of Lecture Notes Comput. Sci., pages 239\u2013250. Springer-Verlag, 1995.","journal-title":"Proc. 4th Workshop Algorithms Data Struct."},{"issue":"1","key":"38_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0925-7721(97)00018-7","volume":"10","author":"G. Liotta","year":"1998","unstructured":"G. Liotta, A. Lubiw, H. Meijer, and S. H. Whitesides. The rectangle of influence drawability problem. Comput. Geom. Theory Appl., 10(1):1\u201322, 1998.","journal-title":"Comput. Geom. Theory Appl."},{"key":"38_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-62592-5_67","volume":"1203","author":"G. Liotta","year":"1997","unstructured":"G. Liotta, R. Tamassia, I. G. Tollis, and P. Vocca. Area requirement of Gabriel drawings. In Algorithms and Complexity (Proc. CIAC\u2019 97), volume 1203 of Lecture Notes Comput. Sci., pages 135\u2013146. Springer-Verlag, 1997.","journal-title":"Algorithms and Complexity (Proc. CIAC\u2019 97)"},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF02293049","volume":"8","author":"C. Monma","year":"1992","unstructured":"C. Monma and S. Suri. Transitions in geometric minimum spanning trees. Discrete Comput. Geom., 8:265\u2013293, 1992.","journal-title":"Discrete Comput. Geom."},{"key":"38_CR12","volume-title":"Spatial Tessellations: Concepts and Applications of Voronoi Diagrams","author":"A. Okabe","year":"1992","unstructured":"A. Okabe, B. Boots, and K. Sugihara. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. John Wiley & Sons, Chichester, UK, 1992."},{"unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 3rd edition, 1988.","key":"38_CR13"},{"issue":"9","key":"38_CR14","doi-asserted-by":"publisher","first-page":"1471","DOI":"10.1109\/5.163412","volume":"80","author":"K. Sugihara","year":"1992","unstructured":"K. Sugihara and M. Iri. Construction of the Voronoi diagram for \u2018one million\u2019 generat ors in single-precision arithmetic. Proc. IEEE, 80(9):1471\u20131484, Sept. 1992.","journal-title":"Proc. IEEE"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46648-7_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T17:14:18Z","timestamp":1585934058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46648-7_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540669043","9783540466482"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-46648-7_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"3 March 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}