{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:09:04Z","timestamp":1760440144467},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[2000,12]]},"abstract":"<jats:p> In this paper, we study orthogonal graph drawings from a practical point of view. Most previously existing algorithms restricted the attention to graphs of maximum degree four. Here we study orthogonal drawing algorithms that work for any input graph, and discuss different models for such drawings. Then we introduce the three-phase method, a generic technique to create high-degree orthogonal drawings. This approach simplifies the description and implementation of orthogonal graph drawing, and can be applied to global as well as interactive and incremental settings. <\/jats:p>","DOI":"10.1142\/s0218195900000310","type":"journal-article","created":{"date-parts":[[2003,5,7]],"date-time":"2003-05-07T08:18:55Z","timestamp":1052295535000},"page":"553-580","source":"Crossref","is-referenced-by-count":11,"title":["THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING"],"prefix":"10.1142","volume":"10","author":[{"given":"THERESE C.","family":"BIEDL","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada"}]},{"given":"BRENDAN P.","family":"MADDEN","sequence":"additional","affiliation":[{"name":"Tom Sawyer Software, 804 Hearst Avenue, Berkeley, CA 94710, USA"}]},{"given":"IOANNIS G.","family":"TOLLIS","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083, USA"}]}],"member":"219","published-online":{"date-parts":[[2012,4,30]]},"reference":[{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(97)00026-6"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02086606"},{"key":"p_22","doi-asserted-by":"publisher","DOI":"10.1007\/s004539910006"},{"key":"p_23","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(97)00017-5"},{"key":"p_24","doi-asserted-by":"publisher","DOI":"10.1109\/12.736444"},{"key":"p_27","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187706"},{"key":"p_28","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321975"},{"key":"p_30","doi-asserted-by":"publisher","DOI":"10.1137\/0216030"},{"key":"p_34","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187705"},{"key":"p_35","doi-asserted-by":"publisher","DOI":"10.1109\/31.34669"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195900000310","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:19:27Z","timestamp":1565093967000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195900000310"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":10,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2012,4,30]]},"published-print":{"date-parts":[[2000,12]]}},"alternative-id":["10.1142\/S0218195900000310"],"URL":"https:\/\/doi.org\/10.1142\/s0218195900000310","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}