{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:52:35Z","timestamp":1725493955307},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671596"},{"type":"electronic","value":"9783540465218"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46521-9_14","type":"book-chapter","created":{"date-parts":[[2007,11,3]],"date-time":"2007-11-03T18:47:16Z","timestamp":1194115636000},"page":"163-173","source":"Crossref","is-referenced-by-count":2,"title":["Triangulations without Minimum-Weight Drawing"],"prefix":"10.1007","author":[{"given":"Cao An","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francis Y.","family":"Chin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boting","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,2,14]]},"reference":[{"key":"14_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/3-540-58950-3_389","volume-title":"Proceedings of GD94","author":"P. Bose","year":"1995","unstructured":"Bose P., Di Battista G., Lenhart W., and Liotta G., Constraints and representable trees, Proceedings of GD94, LNCS 894, pp. 340\u2013351."},{"key":"14_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/3-540-58950-3_388","volume-title":"Proceedings of GD94","author":"G. Battista Di","year":"1995","unstructured":"Di Battista G., Lenhart W., and Liotta G., Proximity drawability: a survey, Proceedings of GD94, LNCS 894, pp. 328\u2013339."},{"key":"14_CR3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. Battista Di","year":"1994","unstructured":"Di Battista G., Eades P., Tamassia R., and Tollis I.G., Algorithms for automatic graph drawing: an annotated bibliography, Computational Geometry: Theory and Applications, 4, 1994, pp. 235\u2013282.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"14_CR4","unstructured":"Di Battista G., Eades P., Tamassia R., and Tollis I.G., Graph Drawing: Algorithms for the Visualization of Graphs, Prentice-Hall, 1999 (ISBN: 0-13-301615-3)."},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF02187810","volume":"5","author":"M. Dillencourt","year":"1990","unstructured":"Dillencourt M., Toughness and Delaunay triangulations, Discrete and Computational Geometry, 5, 1990, pp. 575\u2013601.","journal-title":"Discrete and Computational Geometry"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Eades P. and Whitesides S., The realization problem for Euclidean minimum spanning tree is NP-hard, Proceedings of 10 th ACM Symposium on Computational Geometry, Stony Brook, NY, 1994, pp. 49\u201356.","DOI":"10.1145\/177424.177507"},{"key":"14_CR7","series-title":"Lect Notes Comput Sci","first-page":"252","volume-title":"Proceedings of GD94","author":"H. ElGindy","year":"1995","unstructured":"ElGindy H., Liotta G., Lubiw A., Mejier H., and Whitesides S., Recognizing rectangle of influence drawable graphs, Proceedings of GD94, LNCS 894, pp. 252\u2013263."},{"key":"14_CR8","first-page":"229","volume":"11","author":"I. Fary","year":"1948","unstructured":"Fary I., On straight lines representations of planar graphs, Acta Sci. Math., Szeged, 11, 1948, pp. 229\u2013233.","journal-title":"Acta Sci. Math."},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/0167-8655(92)90048-5","volume":"13","author":"R. Gimikowski","year":"1992","unstructured":"Gimikowski R, Properties of some Euclidean proximity graphs, Pattern Recognition letters, 13, 1992, pp. 417\u2013423.","journal-title":"Pattern Recognition letters"},{"key":"14_CR10","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0925-7721(94)90014-0","volume":"4","author":"M. Keil","year":"1994","unstructured":"Keil M., Computing a subgraph of the minimum-weight triangulation, Computational Geometry: Theory and Applications, 4, 1994, pp. 13\u201326.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0020-0190(96)00012-9","volume":"57","author":"W. Lenhart","year":"1996","unstructured":"Lenhart W. and Liotta G., Drawing outerplanar minimum-weight triangulations, Information Processing Letters, 57, 1996, pp. 253\u2013260.","journal-title":"Information Processing Letters"},{"key":"14_CR12","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proceedings of GD97","author":"W. Lenhart","year":"1995","unstructured":"Lenhart W. and Liotta G., Drawable and forbidden minimum-weight triangulations, Proceedings of GD97, LNCS 894, pp. 1\u201312."},{"issue":"3","key":"14_CR13","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1111\/j.1538-4632.1980.tb00031.x","volume":"12","author":"D. Matula","year":"1980","unstructured":"Matula D. and Sokal R., Properties of Gabriel graphs relevant to geographic variation research and the clustering of points in the plane, Geographical Analysis, 12(3), 1980, pp. 205\u2013222.","journal-title":"Geographical Analysis"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Monma C. and Suri S., Transitions in geometric minimum spanning trees, Proceedings of 7 th ACM Symposium on Computational Geometry, North Conway, NH, 1991, pp. 239\u2013249.","DOI":"10.1145\/109648.109675"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Preparata F. and Shamos M., Computational Geometry, 1985, Springer-Verlag.","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"14_CR16","unstructured":"Wang C.A., Chin F., and Xu Y., A new subgraph of minimum-weight triangulations, Journal of Combinatorial Optimization, 1997, pp. 115\u2013127."},{"issue":"1","key":"14_CR17","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0020-0190(99)00037-X","volume":"70","author":"C.A. Wang","year":"1999","unstructured":"Wang C.A., Chin F., and Yang B.T., Maximum Weight Triangulation and Graph Drawing, Information Processing Letters, 70(1), 1999, pp. 17\u201322.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46521-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T00:44:31Z","timestamp":1556930671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46521-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671596","9783540465218"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-46521-9_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}