{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:24:40Z","timestamp":1725495880545},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540654735"},{"type":"electronic","value":"9783540376231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-37623-2_7","type":"book-chapter","created":{"date-parts":[[2007,11,19]],"date-time":"2007-11-19T12:45:17Z","timestamp":1195476317000},"page":"87-101","source":"Crossref","is-referenced-by-count":9,"title":["A Split&Push Approach to 3D Orthogonal Drawing"],"prefix":"10.1007","author":[{"given":"Giuseppe","family":"Di Battista","sequence":"first","affiliation":[]},{"given":"Maurizio","family":"Patrignani","sequence":"additional","affiliation":[]},{"given":"Francesco","family":"Vargiu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,1,15]]},"reference":[{"key":"7_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/BFb0021785","volume-title":"Proceedings of Graph Drawing\u2019 95","author":"H. Alt","year":"1996","unstructured":"H. Alt, M. Godau, and S. Whitesides. Universal 3-dimensional visibility representations for graphs, in[4], pp. 8\u201319."},{"key":"7_CR2","unstructured":"T. C. Biedl. Heuristics for 3d-orthogonal graph drawings. In Proc. 4th Twente Workshop on Graphs and Combinatorial Optimization, pp. 41\u201344, 1995."},{"key":"7_CR3","unstructured":"P. Bose, H. Everett, S. P. Fekete, A. Lubiw, H. Meijer, K. Romanik, T. Shermer, and S. Whitesides. On a visibility representation for graphs in three dimensions. In D. Avis and P. Bose, eds., Snapshots in Computational and Discrete Geometry, Vol. III, pp. 2\u201325. McGill Univ., July 1994. McGill tech. rep. SOCS-94.50."},{"key":"7_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of Graph Drawing\u2019 95","year":"1996","unstructured":"F. J. Brandenburg, editor: Proceedings of Graph Drawing\u2019 95, Vol. 1027 of LNCS, Springer-Verlag, 1996."},{"key":"7_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BFb0021794","volume-title":"Proceedings of Graph Drawing\u2019 95","author":"I. Bru\u00df","year":"1996","unstructured":"I. Bru\u00df and A. Frick. Fast interactive 3-D graph visualization, in[4], pp. 99\u2013110."},{"key":"7_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/3-540-62495-3_37","volume-title":"Proceedings of Graph Drawing\u2019 96","author":"T. Calamoneri","year":"1997","unstructured":"T. Calamoneri and A. Sterbini. Drawing 2-, 3-, and 4-colorable graphs in O(n\n                           2) volume, in [19], pp. 53\u201362."},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF02522826","volume":"17","author":"R. F. Cohen","year":"1996","unstructured":"R. F. Cohen, P. Eades, T. Lin, and F. Ruskey. Three-dimensional graph drawing. Algorithmica, 17(2):199\u2013208, 1996.","journal-title":"Algorithmica"},{"key":"7_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/BFb0021800","volume-title":"Proceedings of Graph Drawing\u2019 95","author":"I. F. Cruz","year":"1996","unstructured":"I. F. Cruz and J. P. Twarog. 3d graph drawing with simulated annealing, in[4], pp. 162\u2013165."},{"key":"7_CR9","unstructured":"G. Di Battista, editor: Proceedings of Graph Drawing\u2019 97, Vol. 1353 of LNCS, Springer-Verlag, 1998."},{"key":"7_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/BFb0021803","volume-title":"Proceedings of Graph Drawing\u2019 95","author":"D. Dodson","year":"1996","unstructured":"D. Dodson. COMAIDE: Information visualization using cooperative 3D diagram layout, in[4], pp. 190\u2013201."},{"issue":"2","key":"7_CR11","first-page":"97","volume":"60","author":"P. Eades","year":"1987","unstructured":"P. Eades, C. Stirk, and S. Whitesides. The techniques of Kolmogorov and Bardzin for three dimensional orthogonal graph drawings. I. P. L., 60(2):97\u2013103, 1987.","journal-title":"P. L."},{"key":"7_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/3-540-62495-3_44","volume-title":"Proceedings of Graph Drawing\u2019 96","author":"P. Eades","year":"1997","unstructured":"P. Eades, A. Symvonis, and S. Whitesides. Two algorithms for three dimensional orthogonal graph drawing, in[19], pp. 139\u2013154."},{"key":"7_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/BFb0021807","volume-title":"Proceedings of Graph Drawing\u2019 95","author":"S. P. Fekete","year":"1996","unstructured":"S. P. Fekete, M. E. Houle, and S. Whitesides. New results on a visibility representation of graphs in 3-d, in [4] pp. 234\u2013241."},{"key":"7_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/3-540-62495-3_47","volume-title":"Proceedings of Graph Drawing\u2019 96","author":"A. Frick","year":"1997","unstructured":"A. Frick, C. Keskin, and V. Vogelmann. Integration of declarative approaches, in [19], pp. 184\u2013192."},{"key":"7_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1007\/3-540-61680-2_43","volume-title":"Proc. 4th Annu. Europ. Sympos. Algorithms","author":"A. Garg","year":"1996","unstructured":"A. Garg, R. Tamassia, and P. Vocca. Drawing with colors. In Proc. 4th Annu. Europ. Sympos. Algorithms, vol. 1136 of LNCS, pp. 12\u201326. Springer-Verlag, 1996."},{"key":"7_CR16","unstructured":"A. N. Kolmogorov and Y. M. Bardzin. About realization of sets in 3-dimensional space. Problems in Cybernetics, pp. 261\u2013268, 1967."},{"key":"7_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/3-540-60220-8_66","volume-title":"Proc. 4th Workshop Algorithms Data Struct.","author":"G. Liotta","year":"1995","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 LNCS, pp. 239\u2013250. Springer-Verlag, 1995."},{"key":"7_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/BFb0021823","volume-title":"Proceedings of Graph Drawing\u2019 95","author":"B. Monien","year":"1996","unstructured":"B. Monien, F. Ramme, and H. Salmen. A parallel simulated annealing algorithm for generating 3D layouts of undirected graphs, in [4], pp. 396\u2013408."},{"key":"7_CR19","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of Graph Drawing\u2019 96","year":"1997","unstructured":"S. North, editor: Proceedings of Graph Drawing\u2019 96, Vol. 1190 of LNCS, Springer-Verlag, 1997."},{"key":"7_CR20","unstructured":"D. I. Ostry. Some Three-Dimensional Graph Drawing Algorithms. M.Sc. thesis, Dept. Comput. Sci. and Soft. Eng., Univ. Newcastle, Oct. 1996."},{"key":"7_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-63938-1_49","volume-title":"Proceedings of Graph Drawing\u2019 97","author":"J. Pach","year":"1998","unstructured":"J. Pach, T. Thiele, and G. T\u00f3th. Three-dimensional grid drawings of graphs, in [9], pp. 47\u201351."},{"key":"7_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-63938-1_50","volume-title":"Proceedings of Graph Drawing\u2019 97","author":"A. Papakostas","year":"1998","unstructured":"A. Papakostas and I. G. Tollis. Incremental orthogonal graph drawing in three dimensions, in[9], pp. 52\u201363."},{"key":"7_CR23","unstructured":"M. Patrignani and M. Pizzonia The complexity of the matching-cut problem. Tech. Rep. RT-DIA-35-1998, Dept. of Computer Sci., Univ. di Roma Tre, 1998."},{"key":"7_CR24","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of Graph Drawing\u2019 97","author":"M. Patrignani","year":"1998","unstructured":"M. Patrignani and F. Vargiu. 3DCube: A tool for three dimensional graph drawing, in [9], pp. 284-290."},{"key":"7_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/BFb0021836","volume-title":"Proceedings of Graph Drawing\u2019 95","author":"R. Webber","year":"1996","unstructured":"R. Webber and A. Scott. GOVE: Grammar-Oriented Visualisation Environment, in[4], pp. 516\u2013519."},{"key":"7_CR26","unstructured":"D. R. Wood. Two-bend three-dimensional orthogonal grid drawing of maximum degree five graphs. Technical report, School of Computer Science and Software Engineering, Monash University, 1998."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-37623-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T19:30:27Z","timestamp":1551123027000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-37623-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540654735","9783540376231"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-37623-2_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}