{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:01:23Z","timestamp":1725487283120},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540415541"},{"type":"electronic","value":"9783540445418"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44541-2_32","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:01:32Z","timestamp":1184601692000},"page":"338-349","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Weight Drawings of Maximal Triangulations"],"prefix":"10.1007","author":[{"given":"William","family":"Lenhart","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF02712872","volume":"16","author":"O. Aichholzer","year":"1996","unstructured":"Oswin Aichholzer, Franz Aurenhammer, Siu-Wing Chen, Na oki Katoh, Michael Taschwer, G\u00fcnter Rote, and Yin-Feng Xu. Triangulations intersect nicely. Discrete Comput. Geom., 16:339\u2013359, 1996.","journal-title":"Discrete Comput. Geom."},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"T. Biedl, A. Bretscher, and H. Meijer. Drawings of graphs without filled 3-cycles. In Graph Drawing (Proc. GD\u2019 99), volume 1731 of Lecture Notes Comput. Sci., pages 359\u2013368, 2000.","DOI":"10.1007\/3-540-46648-7_37"},{"key":"32_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. Macmillan, London, 1976."},{"key":"32_CR4","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":"32_CR5","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999."},{"key":"32_CR6","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, 1995.","DOI":"10.1007\/3-540-58950-3_388"},{"issue":"6","key":"32_CR7","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, February 1990.","journal-title":"Inform. Process. Lett."},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"M. B. Dillencourt. Toughness and Delaunay triangulations. Discrete Comput. Geom., 5, 1990.","DOI":"10.1007\/BF02187810"},{"key":"32_CR9","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":"32_CR10","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.","journal-title":"Algorithmica"},{"issue":"5","key":"32_CR11","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0020-0190(96)00012-9","volume":"57","author":"W. Lenhart","year":"1996","unstructured":"W. Lenhart and G. Liotta. Drawing outerplanar minimum weight triangulations. Inform. Process. Lett., 57(5):253\u2013260, 1996.","journal-title":"Inform. Process. Lett."},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"W. Lenhart and G. Liotta. How to draw outerplanar minimum weight triangulations. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD\u2019 95), volume 1027 ofLecture Notes Comput. Sci., pages 373\u2013384. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021821"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"William Lenhart and Giuseppe Liotta. Drawable and forbidden minimum weight triangulations. In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97), volume 1353 of Lecture Notes Comput. Sci., pages 1\u201312. Springer-Verlag, 1998.","DOI":"10.1007\/3-540-63938-1_45"},{"issue":"1","key":"32_CR14","doi-asserted-by":"crossref","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":"32_CR15","unstructured":"G. Liotta and H. Meijer. Voronoi drawings of trees. In Graph Drawing (Proc. GD\u2019 99), volume 894 of Lecture Notes Comput. Sci., pages 328\u2013339, 2000."},{"key":"32_CR16","unstructured":"A. Lubiw and N. Sleumer. Maximal outerplanar graphs are relative neighborhood graphs. In Proc. 5th Canad. Conf. Comput. Geom., pages 198\u2013203, 1993."},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF02293049","volume":"8","author":"C. Monma","year":"1992","unstructured":"C. Monma and Subhash Suri. Transitions in geometric minimum spanning trees. Discrete Comput. Geom., 8:265\u2013293, 1992.","journal-title":"Discrete Comput. Geom."},{"key":"32_CR18","unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 3rd edition, October 1990."},{"issue":"1","key":"32_CR19","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0020-0190(99)00037-X","volume":"70","author":"C. A. Wang","year":"1999","unstructured":"Cao An Wang, Francis Y. Chin, and Boting Yang. Maximum weight triangulation and graph drawing. Inform. Process. Lett., 70(1):17\u201322, 1999.","journal-title":"Inform. Process. Lett."},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"Cao An Wang, Francis Y. Chin, and Boting Yang. Triangulations without minimum weight drawing. In Algorithms and Complexity (Proc. CIAC 2000), volume 1767 of Lecture Notes Comput. Sci., pages 163\u2013173. Springer-Verlag, 2000.","DOI":"10.1007\/3-540-46521-9_14"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44541-2_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:19:27Z","timestamp":1556680767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44541-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540415541","9783540445418"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-44541-2_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}