{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:54:33Z","timestamp":1725890073892},"publisher-location":"Berlin, Heidelberg","reference-count":27,"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_45","type":"book-chapter","created":{"date-parts":[[2006,7,18]],"date-time":"2006-07-18T07:35:47Z","timestamp":1153208147000},"page":"1-12","source":"Crossref","is-referenced-by-count":2,"title":["Drawable and forbidden minimum weight 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":[[2005,7,29]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF02712872","volume":"16","author":"O. Aichholzer","year":"1996","unstructured":"O. Aichholzer, F. Aurenhammer, S. W. Chen, N. Katoh, M. Taschwer, G. Rote, and Y.-F. Xu. Triangulations intersect nicely. Discrete Comput. Geom., 16:339\u2013359, 1996.","journal-title":"Discrete Comput. Geom."},{"key":"1_CR2","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 Comput. Sci., pages 340\u2013351. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-58950-3_389"},{"key":"1_CR3","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. (special issue on Graph Drawing, edited by G. Di Battista and R. Tamassia).","journal-title":"Algorithmica"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"S.-W. Cheng and Y.-F. Xu. Approaching the largest \u03b2 -skeleton within a minimum weight triangulation. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 196\u2013203, 1996.","DOI":"10.1145\/237218.237360"},{"key":"1_CR5","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 '94), volume 894 of Lecture Notes Comput. Sci., pages 328\u2013339. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-58950-3_388"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"G. Di Battista, G. Liotta, and S. H. Whitesides. The strength of weak proximity. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes Comput. Sci., pages 178\u2013189. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021802"},{"issue":"3","key":"1_CR7","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/S0895480194264010","volume":"9","author":"G. Battista Di","year":"1996","unstructured":"G. Di Battista and L. Vismara. Angles of planar triangular graphs. SIAM J. Discrete Math., 9(3):349\u2013359, 1996.","journal-title":"SIAM J. Discrete Math."},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"M. T. Dickerson, S. A. McElfresh, and M. H. Montague. New algorithms and empirical findings on minimum weight triangulation heuristics. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 238\u2013247, 1995.","DOI":"10.1145\/220279.220305"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"M. T. Dickerson and M. H. Montague. A (usually?) connected subgraph of the minimum weight triangulation. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 204\u2013213, 1996.","DOI":"10.1145\/237218.237364"},{"key":"1_CR10","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:283\u2013287, 1990.","journal-title":"Inform. Process. Lett."},{"key":"1_CR11","doi-asserted-by":"crossref","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."},{"key":"1_CR12","unstructured":"M. B. Dillencourt and W. D. Smith. Graph-theoretical conditions for inscribability and Delaunay realizability. In Proc. 6th Canad. Conf. Comput. Geom., pages 287\u2013292, 1994."},{"key":"1_CR13","doi-asserted-by":"crossref","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":"1_CR14","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, NY, 1979."},{"key":"1_CR15","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0925-7721(94)90014-0","volume":"4","author":"M. Keil","year":"1994","unstructured":"M. Keil. Computing a subgraph of the minimum weight triangulation. Comput. Geom. Theory Appl., 4:13\u201326, 1994.","journal-title":"Comput. Geom. Theory Appl."},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0020-0190(80)90062-9","volume":"10","author":"D. G. Kirkpatrick","year":"1980","unstructured":"D. G. Kirkpatrick. A note on Delaunay and optimal triangulations. Inform. Process. Lett., 10:127\u2013128, 1980.","journal-title":"Inform. Process. Lett."},{"issue":"12","key":"1_CR17","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":"1_CR18","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 '95), volume 1027 of Lecture Notes Comput. Sci., pages 373\u2013384. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021821"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"W. Lenhart and G. Liotta. Proximity drawings of outerplanar graphs. In S. North, editor, Graph Drawing (Proc. GD '96), volume 1190 of Lecture Notes Comput. Sci., pages 286\u2013302. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-62495-3_55"},{"key":"1_CR20","unstructured":"C. Levcopoulos and D. Krznaric. Quasi-greedy triangulations approximating the minimum weight triangulation. In Proc. 7th ACM-SIAM Sympos. Discrete Algorithms, pages 392\u2013401, 1996."},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"C. Levcopoulos and D. Krzaaric. Tight lower bounds for minimum weight triangulation heuristics. Information Processing Letters, (57):129\u2013135, 1996.","DOI":"10.1016\/0020-0190(95)00200-6"},{"issue":"4","key":"1_CR22","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1137\/0608053","volume":"8","author":"A. Lingas","year":"1987","unstructured":"A. Lingas. A new heuristic for minimum weight triangulation. SIAM J. Algebraic Discrete Methods, 8(4):646\u2013658, 1987.","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"1_CR23","doi-asserted-by":"crossref","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.","DOI":"10.1007\/3-540-60220-8_66"},{"key":"1_CR24","unstructured":"G. Liotta, R. Tamassia, I. G. Tollis, and P. Vocca. Area requirement of Gabriel drawings. In Algorithms and Complexity (Proc. CIAC' 97), volume 955 of Lecture Notes Comput. Sci., pages 239\u2013250. Springer-Verlag, 1995."},{"key":"1_CR25","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":"1_CR26","doi-asserted-by":"crossref","unstructured":"H. Meijer and D. Rappaport. Computing the minimum weight triangulation of a set of linearly ordered points. Information Processing Letters, (42):35\u201338, 1992.","DOI":"10.1016\/0020-0190(92)90129-J"},{"key":"1_CR27","doi-asserted-by":"crossref","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."}],"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_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T23:17:34Z","timestamp":1555715854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63938-1_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540639381","9783540696742"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-63938-1_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}