{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:24:29Z","timestamp":1725495869559},"publisher-location":"Berlin, Heidelberg","reference-count":33,"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_13","type":"book-chapter","created":{"date-parts":[[2007,11,19]],"date-time":"2007-11-19T12:45:17Z","timestamp":1195476317000},"page":"167-182","source":"Crossref","is-referenced-by-count":39,"title":["Planar Polyline Drawings with Good Angular Resolution"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Gutwenger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,1,15]]},"reference":[{"key":"13_CR1","unstructured":"AGD-Library. The AGD-Algorithms Library User Manual. Max-Planck-Institut Saarbr\u00fccken, Universit\u00e4t Halle, Universit\u00e4t K\u00f6ln, 1998. Available via \u201c http:\/\/www.mpi-sb.mpg.de\/AGD\/ \u201d. Partially supported by the DFG-cluster \u201cEffiziente Algorithmen f\u00fcr diskrete Probleme und ihre Anwendungen\u201d."},{"key":"13_CR2","unstructured":"D. Alberts, C. Gutwenger, P. Mutzel, and S. N\u00e4her. The design of the AGD-Algorithms Library. In G.F. Italiano and S. Orlando, editors, Proceedings of the Workshop on Algorithm Engineering (WAE)\u2019 97, 1997. Venice, Italy, Sept. 11\u201313."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"T. Biedl. Optimal orthogonal drawings of connected plane graphs. In Proc. Canadian Conference Computational Geometry (CCCG\u2019 96, volume 5 of International Informatics Series, pages 306\u2013311. Carleton Press, 1996.","DOI":"10.1007\/3-540-61422-2_143"},{"key":"13_CR4","series-title":"Ph.D. thesis, Rutgers","volume-title":"Orthogonal Graph Visualization: The Three-Phase Method with Applications","author":"T. Biedl","year":"1997","unstructured":"T. Biedl. Orthogonal Graph Visualization: The Three-Phase Method with Applications. Ph.D. thesis, Rutgers University, Center for Operations Research, Rutgers, 1997."},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","volume":"9","author":"T. Biedl","year":"1998","unstructured":"T. Biedl and G. Kant. A better heuristic for orthogonal graph drawings. Computational Geometry: Theory and Applications, 9:159\u2013180, 1998.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"13_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/3-540-63938-1_84","volume-title":"Graph Drawing (Proc. GD\u2019 97","author":"T. Biedl","year":"1997","unstructured":"T. Biedl, B. Madden, and I. Tollis. The three-phase method: A unified approach to orthogonal graph drawing. In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97, volume 1353 of Lecture Notes in Computer Science, pages 391\u2013402. Springer-Verlag, 1997."},{"key":"13_CR7","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proc. of the 7th Interdisciplinary Workshop on Informatics and Psychology","author":"F. Brandenburg","year":"1988","unstructured":"F. Brandenburg. Nice drawings of graphs and trees are computationally hard. In Proc. of the 7th Interdisciplinary Workshop on Informatics and Psychology, volume 439 of Lecture Notes in Computer Science, pages 1\u201315. Springer-Verlag, 1988."},{"issue":"3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1142\/S0218195997000144","volume":"7","author":"M. Chrobak","year":"1997","unstructured":"M. Chrobak and G. Kant. Convex grid drawings of 3-connected planar graphs. Interntl. Journal on Computational Geometry and Applications, 7(3):211\u2013224, 1997.","journal-title":"Interntl. Journal on Computational Geometry and Applications"},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix De","year":"1990","unstructured":"H. De Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10(1):41\u201351, 1990.","journal-title":"Combinatorica"},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. Battista Di","year":"1994","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4:235\u2013282, 1994.","journal-title":"Comput. Geom. Theory Appl."},{"key":"13_CR11","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","volume":"7","author":"G. Battista Di","year":"1997","unstructured":"G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. Comput. Geom. Theory Appl., 7:303\u2013326, 1997.","journal-title":"Comput. Geom. Theory Appl."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"P. Eades and P. Mutzel. Graph Drawing Algorithms, CRC Handbook of Algorithms and Theory of Computation, Chapter 9, M. Atallah (Ed.). CRC Press, 1998. To appear.","DOI":"10.1201\/9781420049503-c10"},{"key":"13_CR13","unstructured":"S. Fialko and P. Mutzel. A new approximation algorithm for the planar augmentation problem. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u2019 98, pages 260\u2013269, San Francisco, California, 1998. ACM Press."},{"key":"13_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-63938-1_57","volume-title":"Graph Drawing (Proc. GD\u2019 97","author":"U. F\u00f6\u00dfmeier","year":"1997","unstructured":"U. F\u00f6\u00dfmeier and M. Kaufmann. Algorithms and area bounds for nonplanar orthogonal drawings. In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97, volume 1353 of Lecture Notes in Computer Science, pages 134\u2013145. Springer-Verlag, 1997."},{"issue":"3","key":"13_CR15","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M. R. Garey","year":"1983","unstructured":"M. R. Garey and D. S. Johnson. Crossing number is NP-complete. SIAM J. Algebraic Discrete Methods, 4(3):312\u2013316, 1983.","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"1\/2","key":"13_CR16","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\/2):43\u201382, 1998.","journal-title":"Comput. Geom. Theory Appl."},{"key":"13_CR17","volume-title":"Report CS-94-10","author":"A. Garg","year":"1994","unstructured":"A. Garg and R. Tamassia. On the computational complexity of upward and rectilinear planarity testing. Report CS-94-10, Comput. Sci. Dept., Brown Univ., Providence RI, 1994."},{"key":"13_CR18","series-title":"Lect Notes Comput Sci","first-page":"12","volume-title":"Proc. 2nd Annual European Sympos. Algorithms (ESA\u2019 94","author":"A. Garg","year":"1994","unstructured":"A. Garg and R. Tamassia. Planar drawings and angular resolution: Algorithms and bounds. In Proc. 2nd Annual European Sympos. Algorithms (ESA\u2019 94, volume 855 of Lecture Notes in Computer Science, pages 12\u201323. Springer-Verlag, 1994."},{"key":"13_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/3-540-62495-3_49","volume-title":"Graph Drawing (Proc. GD\u2019 96","author":"A. Garg","year":"1997","unstructured":"A. Garg and R. Tamassia. A new minimum cost flow algorithm with applications to graph drawing. In S. North, editor, Graph Drawing (Proc. GD\u2019 96, volume 1190 of Lecture Notes in Computer Science, pages 201\u2013216. Springer-Verlag, 1997."},{"key":"13_CR20","volume-title":"Extended Abstract","author":"C. Gutwenger","year":"1997","unstructured":"C. Gutwenger and P. Mutzel. Grid embeddings of biconnected planar graphs. Extended Abstract, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany, 1997."},{"issue":"4","key":"13_CR21","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"J. Hopcroft and R. E. Tarjan. Efficient planarity testing. J. ACM, 21(4):549\u2013568, 1974.","journal-title":"J. ACM"},{"key":"13_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/3-540-63938-1_72","volume-title":"Graph Drawing (Proc. GD\u2019 97","author":"C. Hundack","year":"1997","unstructured":"C. Hundack, P. Mutzel, I. Pouchkarev, and S. Thome. ArchE: A graph drawing system for archaeology. In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97, volume 1353 of Lecture Notes in Computer Science, pages 297\u2013302. Springer-Verlag, 1997."},{"issue":"1","key":"13_CR23","first-page":"4","volume":"16","author":"G. Kant","year":"1996","unstructured":"G. Kant. Drawing planar graphs using the canonical ordering. Algorithmica, Special Issue on Graph Drawing, 16(1):4\u201332, 1996.","journal-title":"Algorithmica, Special Issue on Graph Drawing"},{"key":"13_CR24","volume-title":"Technical Report MPI-I-98-1-013","author":"G. W. Klau","year":"1998","unstructured":"G. W. Klau and P. Mutzel. Quasi-orthogonal drawing of planar graphs. Technical Report MPI-I-98-1-013, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, 1998."},{"key":"13_CR25","first-page":"129","volume-title":"Advances in Computing Research","author":"M. R. Kramer","year":"1985","unstructured":"M. R. Kramer and J. van Leeuwen. The complexity of wire-routing and finding minimum area layouts for arbitrary VLSI circuits. In F. P. Preparata, editor, Advances in Computing Research, volume 2, pages 129\u2013146. JAI Press, Greenwich, Conn., 1985."},{"key":"13_CR26","unstructured":"P. Mutzel and S. Fialko. New approximation algorithms for planar augmentation. Extended Abstract, to appear, 1998."},{"key":"13_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-63938-1_67","volume-title":"Graph Drawing (Proc. GD\u2019 97","author":"H. Purchase","year":"1997","unstructured":"H. Purchase. Which aesthetic has the greatest effect on human understanding? In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97, volume 1353 of Lecture Notes in Computer Science, pages 248\u2013261. Springer-Verlag, 1997."},{"key":"13_CR28","first-page":"31","volume":"56","author":"R. Read","year":"1987","unstructured":"R. Read. New methods for drawing a planar graph given the cyclic order of the edges at each vertex. Congr. Numer., 56:31\u201344, 1987.","journal-title":"Congr. Numer."},{"key":"13_CR29","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/net.3230140202","volume":"14","author":"J. A. Storer","year":"1984","unstructured":"J. A. Storer. On minimal node-cost planar embeddings. Networks, 14:181\u2013212, 1984.","journal-title":"Networks"},{"issue":"3","key":"13_CR30","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. SI AM J. Comput., 16(3):421\u2013444, 1987.","journal-title":"SI AM J. Comput."},{"issue":"1","key":"13_CR31","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/21.87055","volume":"SMC-18","author":"R. Tamassia","year":"1988","unstructured":"R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern., SMC-18(1):61\u201379, 1988.","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"13_CR32","unstructured":"R. Tamassia and I. G. Tollis. Efficient embedding of planar graphs in linear time. In Proc. IEEE Internat. Sympos. on Circuits and Systems, pages 495\u2013498, 1987."},{"issue":"9","key":"13_CR33","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/31.34669","volume":"CAS-36","author":"R. Tamassia","year":"1989","unstructured":"R. Tamassia and I. G. Tollis. Planar grid embedding in linear time. IEEE Trans, on Circuits and Systems, CAS-36(9):1230\u20131234, 1989.","journal-title":"IEEE Trans, on Circuits and Systems"}],"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_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T19:20:21Z","timestamp":1556997621000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-37623-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540654735","9783540376231"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-37623-2_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}