{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:01:24Z","timestamp":1725487284324},"publisher-location":"Berlin, Heidelberg","reference-count":14,"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_25","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:01:32Z","timestamp":1184601692000},"page":"259-271","source":"Crossref","is-referenced-by-count":3,"title":["Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings"],"prefix":"10.1007","author":[{"given":"David R.","family":"Wood","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"issue":"7","key":"25_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00010","volume":"2","author":"T. C. Biedl","year":"1998","unstructured":"T. C. Biedl. New lower bounds for orthogonal drawings. J. Graph Algorithms Appl., 2(7):1\u201331, 1998. 260","journal-title":"J. Graph Algorithms Appl."},{"key":"25_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/3-540-46648-7_5","volume-title":"Fully dynamic 3-dimensional orthogonal graph drawing","author":"M. Closson","year":"1999","unstructured":"M. Closson, S. Gartshore, J. Johansen, and S. K. Wismath. Fully dynamic 3-dimensional orthogonal graph drawing. In J. Kratochvil, editor, Proc. Graph Drawing: 7th International Symp. (GD\u201999), volume 1731 of Lecture Notes in Comput. Sci., pages 49\u201358, Springer, 1999. 259, 261"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"G. Di Battista, M. Patrignani, and F. Vargiu. A split&push approach to 3D orthogonal drawing. In Whitesides [10], pages 87\u2013101. 259, 261","DOI":"10.1007\/3-540-37623-2_7"},{"issue":"2","key":"25_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0020-0190(96)00133-0","volume":"60","author":"P. Eades","year":"1996","unstructured":"P. Eades, C. Stirk, and S. Whitesides. The techniques of Komolgorov and Bardzin for three dimensional orthogonal graph drawings. Inform. Proc. Lett., 60(2):97\u2013103, 1996. 259, 260","journal-title":"Inform. Proc. Lett."},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0166-218X(00)00172-4","volume":"103","author":"P. Eades","year":"2000","unstructured":"P. Eades, A. Symvonis, and S. Whitesides. Three dimensional orthogonal graph drawing algorithms. Discrete Applied Math., 103:55\u201387, 2000. 259, 260, 261, 261, 261, 261, 261","journal-title":"Discrete Applied Math."},{"key":"25_CR6","first-page":"261","volume":"8","author":"A. N. Kolmogorov","year":"1967","unstructured":"A. N. Kolmogorov and Ya. M. Barzdin. On the realization of nets in 3-dimensional space. Problems in Cybernetics, 8:261\u2013268, March 1967. 259, 260, 261","journal-title":"Problems in Cybernetics"},{"issue":"4","key":"25_CR7","doi-asserted-by":"crossref","first-page":"81","DOI":"10.7155\/jgaa.00019","volume":"3","author":"A. Papakostas","year":"1999","unstructured":"A. Papakostas and I. G. Tollis. Algorithms for incremental orthogonal graph drawing in three dimensions. J. Graph Algorithms Appl., 3(4):81\u2013115, 1999. 259, 261, 261, 261","journal-title":"J. Graph Algorithms Appl."},{"key":"25_CR8","series-title":"Lect Notes Comput Sci","first-page":"284","volume-title":"3DCube: a tool for three dimensional graph drawing","author":"M. Patrignani","year":"1998","unstructured":"M. Patrignani and F. Vargiu. 3DCube: a tool for three dimensional graph drawing. In G. Di Battista, editor, Proc. Graph Drawing: 5th International Symp. (GD\u201997), volume 1353 of Lecture Notes in Comput. Sci., pages 284\u2013290, Springer, 1998. 259, 261"},{"issue":"1","key":"25_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0020-0190(91)90059-Q","volume":"39","author":"R. Tamassia","year":"1991","unstructured":"R. Tamassia, I. G. Tollis, and J. S. Vitter. Lower bounds for planar orthogonal drawings of graphs. Inform. Process. Lett., 39(1):35\u201340, 1991. 260","journal-title":"Inform. Process. Lett."},{"key":"25_CR10","series-title":"Lect Notes Comput Sci","volume-title":"Proc. Graph Drawing: 6th International Symp. (GD\u201998)","year":"1998","unstructured":"S. Whitesides, editor. Proc. Graph Drawing: 6th International Symp. (GD\u201998), volume 1547 of Lecture Notes in Comput. Sci., Springer, 1998. 271, 271"},{"key":"25_CR11","unstructured":"D. R. Wood. On higher-dimensional orthogonal graph drawing. In J. Harland, editor, Proc. Computing: the Australasian Theory Symp. (CATS\u201997), volume 19(2) of Austral. Comput. Sci. Comm., pages 3\u20138, 1997. 260, 260"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"D. R. Wood. An algorithm for three-dimensional orthogonal graph drawing. In Whitesides [10], pages 332\u2013346. 259, 261, 262, 268, 269","DOI":"10.1007\/3-540-37623-2_25"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"D. R. Wood. Lower bounds for the number of bends in three-dimensional orthogonal graph drawings. Technical Report CS-AAG-2000-01, Basser Department of Computer Science, The University of Sydney, 2000. 259, 262","DOI":"10.1007\/3-540-44541-2_25"},{"key":"25_CR14","volume-title":"Three-Dimensional Orthogonal Graph Drawing","author":"D. R. Wood","year":"2000","unstructured":"D. R. Wood. Three-Dimensional Orthogonal Graph Drawing. PhDthesis, School of Computer Science and Software Engineering, Monash University, Australia, 2000. 259, 260, 261, 261, 261, 268"}],"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_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:19:26Z","timestamp":1556680766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44541-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540415541","9783540445418"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44541-2_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}