{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:34:05Z","timestamp":1725489245494},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540669043"},{"type":"electronic","value":"9783540466482"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46648-7_2","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T08:29:28Z","timestamp":1186907368000},"page":"8-26","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Turn-Regularity and Planar Orthogonal Drawings"],"prefix":"10.1007","author":[{"given":"Stina S.","family":"Bridgeman","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Vismara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,3,3]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"P. Bertolazzi, G. Di Battista, and W. Didimo. Computing orthogonal drawings with the minimum number of bends. In F. Dehne, A. Rau-Chaplin, J.-R. Sack, and R. Tamassia, editors, Algorithms and Data Structures (Proc. WADS\u2019 97), volume 1272 of Lecture Notes Comput. Sci., pages 331\u2013344. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63307-3_72"},{"issue":"12","key":"2_CR2","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/BF01188716","volume":"6","author":"P. Bertolazzi","year":"1994","unstructured":"P. Bertolazzi, G. Di Battista, G. Liotta, and C. Mannino. Upward drawings of triconnected digraphs. Algorithmica, 6(12):476\u2013497, 1994.","journal-title":"Algorithmica"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"T. C. Biedl. New lower bounds for orthogonal graph drawings. In F. J. Bran-denburg, editor, Graph Drawing (Proc. GD\u2019 95), volume 1027 of Lecture Notes Comput. Sci., pages 28\u201339. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021788"},{"issue":"3","key":"2_CR4","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","volume":"9","author":"T. C. Biedl","year":"1998","unstructured":"T. C. Biedl and G. Kant. A better heuristic for orthogonal graph drawings. Comput. Geom. Theory Appl., 9(3):159\u2013180, 1998.","journal-title":"Comput. Geom. Theory Appl."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"J. A. Bondy and U. S. R. Murty. Graph Theory with Applications. North-Holland, Amsterdam, The Netherlands, 1976.","DOI":"10.1007\/978-1-349-03521-2"},{"key":"2_CR6","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999."},{"issue":"5-6","key":"2_CR7","doi-asserted-by":"publisher","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(5-6):303\u2013325, 1997.","journal-title":"Comput. Geom. Theory Appl."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"G. Di Battista and G. Liotta. Upward planarity checking: \u201cFaces are more than polygons\u201d. In S. H. Whitesides, editor, Graph Drawing (Proc. GD\u2019 98), volume 1547 of Lecture Notes Comput. Sci., pages 72\u201386. Springer-Verlag, 1998.","DOI":"10.1007\/3-540-37623-2_6"},{"issue":"6","key":"2_CR9","doi-asserted-by":"publisher","first-page":"1764","DOI":"10.1137\/S0097539794262847","volume":"27","author":"G. Battista Di","year":"1998","unstructured":"G. Di Battista, G. Liotta, and F. Vargiu. Spirality and optimal orthogonal drawings. SIAM J. Comput., 27(6):1764\u20131811, 1998.","journal-title":"SIAM J. Comput."},{"issue":"23","key":"2_CR10","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G. Battista Di","year":"1988","unstructured":"G. Di Battista and R. Tamassia. Algorithms for plane representations of acyclic digraphs. Theoret. Comput. Sci.,61(2,3):175\u2013198, 1988.","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"W. Didimo and G. Liotta. Computing orthogonal drawings in a variable embedding setting. In K.-Y. Chwa and O. H. Ibarra, editors, Algorithms and Computation (Proc. ISAAC\u2019 98), volume 1533 of Lecture Notes Comput. Sci., pages 79\u201388. Springer-Verlag, 1998.","DOI":"10.1007\/3-540-49381-6_10"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"U. F\u00f6\u00dfmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD\u2019 95), volume 1027 of Lecture Notes Comput. Sci., pages 254\u2013266. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021809"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"A. Garg and R. Tamassia. Planar drawings and angular resolution: Algorithms and bounds. In J. van Leeuwen, editor, Algorithms (Proc. ESA\u2019 94), volume 855 of Lecture Notes Comput. Sci., pages 12\u201323. Springer-Verlag, 1994. 26 S.S. Bridgeman et al.","DOI":"10.1007\/BFb0049393"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"A. Garg and R. Tamassia. On the computational complexity of upward and rectilinear planarity testing. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD\u2019 94), volume 894 of Lecture Notes Comput. Sci., pages 286\u2013297. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-58950-3_384"},{"key":"2_CR15","doi-asserted-by":"crossref","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 Comput. Sci., pages 201\u2013216. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-62495-3_49"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"N. Gelfand and R. Tamassia. Algorithmic patterns for orthogonal graph drawing. In S. H. Whitesides, editor, Graph Drawing (Proc. GD\u2019 98), volume 1547 of Lecture Notes Comput. Sci., pages 138\u2013152. Springer-Verlag, 1998.","DOI":"10.1007\/3-540-37623-2_11"},{"key":"2_CR17","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"F. Harary. Graph Theory. Addison-Wesley, Reading, MA, 1969."},{"issue":"2","key":"2_CR18","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0020-0190(88)90032-4","volume":"29","author":"F. Hoffmann","year":"1988","unstructured":"F. Hoffmann and K. Kriegel. Embedding rectilinear graphs in linear time. Inform. Process. Lett., 29(2):75\u201379, 1988.","journal-title":"Inform. Process. Lett."},{"key":"2_CR19","unstructured":"M. Y. Hsueh and D. O. Pederson. Computer-aided layout of lsi circuit building-blocks. In Proc. IEEE Internat. Symp. Circuits and Systems, 1979."},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"G. W. Klau and P. Mutzel. Optimal compaction of orthogonal grid drawings. In G. Cornuejols, R. E. Burkard, and G. J. Woeginger, editors, Integer Programming and Combinatorial Optimization (Proc. IPCO\u2019 99), volume 1610 of Lecture Notes Comput. Sci., pages 304\u2013319. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-48777-8_23"},{"key":"2_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"T. Lengauer","year":"1990","unstructured":"T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. B. G. Teubner-John Wiley & Sons, Stuttgart, Germany-Chichester, England, 1990."},{"key":"2_CR22","unstructured":"R. H. J. M. Otten and J. G. van Wijk. Graph representations in interactive layout design. In Proc. IEEE Internat. Sympos. Circuits and Systems, pages 914\u2013918, 1978."},{"issue":"1-2","key":"2_CR23","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0925-7721(97)00017-5","volume":"9","author":"A. Papakostas","year":"1998","unstructured":"A. Papakostas and I. G. Tollis. Algorithms for area-efficient orthogonal drawings. Comput. Geom. Theory Appl., 9(1-2):83\u2013110, 1998. Special Issue on Geometric Representations of Graphs, G. Di Battista and R. Tamassia, editors.","journal-title":"Comput. Geom. Theory Appl."},{"key":"2_CR24","unstructured":"M. Patrignani. On the complexity of orthogonal compaction. In F. Dehne, A. Gupta, J.-R. Sack, and R. Tamassia, editors, Algorithms and Data Structures (Proc. WADS\u2019 99), volume 1663 of Lecture Notes Comput. Sci., pages 56\u201361. Springer-Verlag, 1999."},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"J. M. Six, K. G. Kakoulis, and I. G. Tollis. Refinement of orthogonal graph drawings. In S. H. Whitesides, editor, Graph Drawing (Proc. GD\u2019 98), volume 1547 of Lecture Notes Comput. Sci., pages 302\u2013315. Springer-Verlag, 1998.","DOI":"10.1007\/3-540-37623-2_23"},{"issue":"2\/3","key":"2_CR26","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0019-9958(83)80038-2","volume":"57","author":"L. Stockmeyer","year":"1983","unstructured":"L. Stockmeyer. Optimal orientation of cells in slicing floorplan design. Inform. Control, 57(2\/3):91\u2013101, 1983.","journal-title":"Inform. Control"},{"issue":"3","key":"2_CR27","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."},{"issue":"9","key":"2_CR28","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/31.34669","volume":"36","author":"R. Tamassia","year":"1989","unstructured":"R. Tamassia and I. G. Tollis. Planar grid embedding in linear time. IEEE Trans. Circuits Syst., CAS-36(9):1230\u20131234, 1989.","journal-title":"IEEE Trans. Circuits Syst."},{"issue":"1","key":"2_CR29","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.","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"2_CR30","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(2):355\u2013372, 1985.","journal-title":"SIAM J. Comput."},{"issue":"3","key":"2_CR31","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1109\/31.1739","volume":"35","author":"W. Wimer","year":"1988","unstructured":"W. Wimer, I. Koren, and I. Cederbaum. Floorplans, planar graphs and layouts. IEEE Trans. Circuits Syst., CAS-35(3):267\u2013278, 1988.","journal-title":"IEEE Trans. Circuits Syst."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46648-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T17:14:35Z","timestamp":1585934075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46648-7_2"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540669043","9783540466482"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-46648-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"3 March 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}