{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:54:25Z","timestamp":1725558865992},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245285"},{"type":"electronic","value":"9783540318439"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31843-9_33","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T20:54:14Z","timestamp":1278363254000},"page":"329-339","source":"Crossref","is-referenced-by-count":1,"title":["The Three Dimensional Logic Engine"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Kitching","sequence":"first","affiliation":[]},{"given":"Sue","family":"Whitesides","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"33_CR1","first-page":"219","volume":"14","author":"A.G. Bell","year":"1903","unstructured":"Bell, A.G.: Tetrahedral principle in kite structure. National Geographic Magazine\u00a014(6), 219\u2013251 (1903)","journal-title":"National Geographic Magazine"},{"key":"33_CR2","unstructured":"Buckminster Fuller, R.: Inventions, the Patented Works of R. Buckminster Fuller. St. Martin\u2019s Press (1983)"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF02086609","volume":"16","author":"P. Bose","year":"1996","unstructured":"Bose, P., Lenhart, W., Liotta, G.: Characterizing proximity trees. Algorithmica\u00a016, 83\u2013110 (1996)","journal-title":"Algorithmica"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-540-24595-7_55","volume-title":"Graph Drawing","author":"F.J. Brandenburg","year":"2004","unstructured":"Brandenburg, F.J., Eppstein, D., Goodrich, M.T., Kobourov, S.G., Liotta, G., Mutzel, P.: Selected open problems in graph drawing. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 515\u2013539. Springer, Heidelberg (2004)"},{"key":"33_CR5","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing, \u00a0ch. 11.2. Prentice Hall, Englewood Cliffs (1999)"},{"issue":"6","key":"33_CR6","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0020-0190(90)90210-O","volume":"33","author":"M.B. Dillencourt","year":"1990","unstructured":"Dillencourt, M.B.: Realizability of Delaunay triangulations. Informa. Process. Lett.\u00a033(6), 283\u2013287 (1990)","journal-title":"Informa. Process. Lett."},{"key":"33_CR7","unstructured":"Dillencourt, M.B., Smith, W.D.: Graph-theoretical conditions for inscribability and Delaunay realizability. In: Proc. 6th Canad. Conf. Comput. Geom., pp. 287\u2013292 (1994)"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0304-3975(97)84223-5","volume":"169","author":"P. Eades","year":"1996","unstructured":"Eades, P., Whitesides, S.: The logic engine and the realization problem for nearest neighbour graphs. Theoretical Computer Science\u00a0169, 23\u201337 (1996)","journal-title":"Theoretical Computer Science"},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/BF02086608","volume":"16","author":"P. Eades","year":"1996","unstructured":"Eades, P., Whitesides, S.: The realization problem for Euclidean minimum spanning trees is NP-hard. Algorithmica\u00a016, 60\u201382 (1996)","journal-title":"Algorithmica"},{"key":"33_CR10","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: a Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"issue":"9","key":"33_CR11","doi-asserted-by":"publisher","first-page":"1502","DOI":"10.1109\/5.163414","volume":"80","author":"J.W. Jaromczyk","year":"1992","unstructured":"Jaromczyk, J.W., Toussaint, G.T.: Relative neighborhood graphs and their relatives. Proc. IEEE\u00a080(9), 1502\u20131517 (1992)","journal-title":"Proc. IEEE"},{"key":"33_CR12","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0304-3975(00)00383-2","volume":"27","author":"W. Lenhart","year":"2002","unstructured":"Lenhart, W., Liotta, G.: The drawability problem for minimum weight triangulations. Theoret. Comp. Sci.\u00a027, 261\u2013286 (2002)","journal-title":"Theoret. Comp. Sci."},{"key":"33_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/3-540-60220-8_66","volume-title":"Algorithms and Data Structures","author":"G. Liotta","year":"1995","unstructured":"Liotta, G., Di Battista, G.: Computing proximity drawings of trees in the 3-dimensional space. In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995. LNCS, vol.\u00a0955, pp. 239\u2013250. Springer, Heidelberg (1995)"},{"issue":"1","key":"33_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0925-7721(97)00018-7","volume":"10","author":"G. Liotta","year":"1998","unstructured":"Liotta, G., Lubiw, A., Meijer, H., Whitesides, S.H.: The rectangle of influence drawability problem. Comput. Geom. Theory Appl.\u00a010(1), 1\u201322 (1998)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"3","key":"33_CR15","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0925-7721(02)00137-2","volume":"24","author":"G. Liotta","year":"2003","unstructured":"Liotta, G., Meijer, H.: Drawing of trees. Computational Geometry: Theory and Applications\u00a024(3), 147\u2013178 (2003)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"33_CR16","first-page":"229","volume-title":"Computational Morphology","author":"G. Toussaint","year":"1988","unstructured":"Toussaint, G.: A graph-theoretical primal sketch. In: Computational Morphology, pp. 229\u2013260. North-Holland, Amsterdam (1988)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31843-9_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:42:00Z","timestamp":1620013320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31843-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245285","9783540318439"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31843-9_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}