{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:01:22Z","timestamp":1725487282278},"publisher-location":"Berlin, Heidelberg","reference-count":16,"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_26","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:01:32Z","timestamp":1184601692000},"page":"272-283","source":"Crossref","is-referenced-by-count":4,"title":["Orthogonal Drawings of Cycles in 3D Space"],"prefix":"10.1007","author":[{"given":"Giuseppe","family":"Di Battista","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Lubiw","sequence":"additional","affiliation":[]},{"given":"Sue","family":"Whitesides","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"key":"26_CR1","unstructured":"T. C. Biedl. Heuristics for 3d-orthogonal graph drawings. In Proc. 4th Twente Workshop on Graphs and Combinatorial Optimization, pp. 41\u201344, 1995."},{"issue":"4","key":"26_CR2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.7155\/jgaa.00018","volume":"3","author":"T. Biedl","year":"1999","unstructured":"T. Biedl, T. Shermer, S. Wismath, and S. Whitesides. Orthogonal 3-D graph drawing. J. Graph Algorithms and Applications, 3(4):63\u201379, 1999.","journal-title":"J. Graph Algorithms and Applications"},{"issue":"2","key":"26_CR3","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF02522826","volume":"17","author":"R. F. Cohen","year":"1997","unstructured":"R. F. Cohen, P. Eades, T. Lin and F. Ruskey. Three-dimensional graph drawing. Algorithmica, 17(2):199\u2013208, 1997.","journal-title":"Algorithmica"},{"key":"26_CR4","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. Tollis. Graph Drawing. Prentice Hall, 1999."},{"key":"26_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/3-540-44968-X_7","volume-title":"Embedding problems for paths with direction constrained edges","author":"G. Battista Di","year":"2000","unstructured":"G. Di Battista, G. Liotta, A. Lubiw, and S. Whitesides. Embedding problems for paths with direction constrained edges. In D.-Z. Du, P. Eades, V. Estivill-Castro, X. Lin, and A. Sharma, eds., Computing and Combinatorics, 6th Ann. Int. Conf., COCOON 2000, Springer-Verlag LNCS vol. 1858, pp. 64\u201373, 2000."},{"issue":"3","key":"26_CR6","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":"26_CR7","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. Process. Lett., 60:97\u2013103, 1996.","journal-title":"Inform. Process. Lett."},{"key":"26_CR8","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., vol. 103, pp. 55\u201387, 2000.","journal-title":"Discrete Applied Math."},{"issue":"1\u20132","key":"26_CR9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0925-7721(97)00016-3","volume":"9","author":"A. Garg","year":"1998","unstructured":"A. Garg. New results on drawing angle graphs. Comput. Geom. Theory Appl., 9(1\u20132):43\u201382, 1998. Special Issue on Geometric Representations of Graphs, G. Di Battista and R. Tamassia, eds..","journal-title":"Comput. Geom. Theory Appl."},{"issue":"4","key":"26_CR10","doi-asserted-by":"crossref","first-page":"81","DOI":"10.7155\/jgaa.00019","volume":"3","author":"A. Papakostas","year":"1999","unstructured":"A. Papakostas and I. Tollis. Algorithms for incremental orthogonal graph drawing in three dimensions. J. Graph Algorithms and Appl., 3(4):81\u2013115, 1999.","journal-title":"J. Graph Algorithms and Appl."},{"issue":"3","key":"26_CR11","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421\u2013444, 1987.","journal-title":"SIAM J. Comput."},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1137\/0214027","volume":"14","author":"G. Vijayan","year":"1985","unstructured":"G. Vijayan and A. Wigderson. Rectilinear graphs and their embeddings. SIAM J. Comput., 14:355\u2013372, 1985.","journal-title":"SIAM J. Comput."},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"V. Vijayan. Geometry of planar graphs with angles. In Proc. 2nd Annu. ACM Sympos. Comput. Geom., pp. 116\u2013124, 1986.","DOI":"10.1145\/10515.10528"},{"key":"26_CR14","unstructured":"D. R. Wood. Two-bend three-dimensional orthogonal grid drawing of maximum degree five graphs. TR 98\/03, School of Computer Science and Software Engineering, Monash University, 1998."},{"key":"26_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/3-540-37623-2_25","volume-title":"An algorithm for three-dimensional orthogonal graph drawing","author":"D. R. Wood","year":"1998","unstructured":"D. R. Wood. An algorithm for three-dimensional orthogonal graph drawing. In S. Whitesides, ed., Graph Drawing (6th Int. Symp., GD\u2019 98), Springer-Verlag, LNCS vol. 1547, pp. 332\u2013346, 1998."},{"key":"26_CR16","unstructured":"D. R. Wood. Three-Dimensional Orthogonal Graph Drawing. Ph.D. thesis, School of Computer Science and Software Engineering, Monash University, 2000."}],"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_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T00:58:20Z","timestamp":1550451500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44541-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540415541","9783540445418"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44541-2_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}