{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:58Z","timestamp":1759638838443},"reference-count":42,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5676,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0925-7721(97)00016-3","type":"journal-article","created":{"date-parts":[[2003,4,24]],"date-time":"2003-04-24T22:53:11Z","timestamp":1051224791000},"page":"43-82","source":"Crossref","is-referenced-by-count":12,"title":["New results on drawing angle graphs"],"prefix":"10.1016","volume":"9","author":[{"given":"Ashim","family":"Garg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(97)00016-3_BIB1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0164-1212(84)90006-2","article-title":"Computer aided layout of entity-relationship diagrams","volume":"4","author":"Batini","year":"1984","journal-title":"J. Systems Software"},{"key":"10.1016\/S0925-7721(97)00016-3_BIB2","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1142\/S0218195994000215","article-title":"How to draw a series-paralled digraph","volume":"4","author":"Bertolazzi","year":"1994","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/S0925-7721(97)00016-3_BIB3","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","article-title":"A framework for solving VLSI graph layout problems","volume":"28","author":"Bhatt","year":"1984","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/S0925-7721(97)00016-3_BIB4","series-title":"Proc. 2nd Annu. European Sympos. Algorithms (ESA '94)","first-page":"24","article-title":"A better heuristic for orthogonal graph drawings","volume":"855","author":"Biedl","year":"1994"},{"key":"10.1016\/S0925-7721(97)00016-3_BIB5","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property interval graphs and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/S0925-7721(97)00016-3_BIB6","series-title":"Progress in Graph Theory","first-page":"153","article-title":"Linear algorithms for convex drawings of planar graphs","author":"Chiba","year":"1984"},{"key":"10.1016\/S0925-7721(97)00016-3_BIB7","doi-asserted-by":"crossref","DOI":"10.1016\/0020-0190(95)00020-D","article-title":"A linear time algorithm for drawing a planar graph on a grid","author":"Chrobak","year":"1990"},{"key":"10.1016\/S0925-7721(97)00016-3_BIB8","series-title":"Graph Drawing (Proc. GD '94)","first-page":"404","article-title":"Drawing graphs by example efficiently: Trees and planar acyclic digraphs","volume":"894","author":"Cruz","year":"1995"},{"key":"10.1016\/S0925-7721(97)00016-3_BIB9","series-title":"Graph Drawing '93, Proc. ALCOM Workshop on Graph Drawing","article-title":"A visual approach to graph drawing","author":"Cruz","year":"1993"},{"issue":"1","key":"10.1016\/S0925-7721(97)00016-3_BIB10","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02122694","article-title":"How to draw a planar graph on a grid","volume":"10","author":"De Fraysseix","year":"1990","journal-title":"Combinatorica"},{"issue":"5","key":"10.1016\/S0925-7721(97)00016-3_BIB11","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","article-title":"Algorithms for drawing graphs: an annotated bibliography","volume":"4","author":"Di Battista","year":"1994","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"5\u20136","key":"10.1016\/S0925-7721(97)00016-3_BIB12","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","article-title":"An experimental comparison of four graph drawing algorithms","volume":"7","author":"Di Battista","year":"1997","journal-title":"Computational Geometry: Theory and Applications"},{"key":"10.1016\/S0925-7721(97)00016-3_BIB13","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF02187850","article-title":"Area requirement and symmetry display of planar upward drawings","volume":"7","author":"Di Battista","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(97)00016-3_BIB14","series-title":"Proc. 25th Annu. ACM Sympos. Theory Comput. (STOC '93)","first-page":"431","article-title":"Angles of planar triangular graphs","author":"Di Battista","year":"1993"},{"key":"10.1016\/S0925-7721(97)00016-3_BIB15","first-page":"147","article-title":"Planar embedding of planar graphs","volume":"Vol. 2","author":"Dolev","year":"1985"},{"key":"10.1016\/S0925-7721(97)00016-3_BIB16","series-title":"Graph Drawing '93, Proc. ALCOM Workshop on Graph Drawing","article-title":"Algorithmic and declarative approaches to aesthetic layout","author":"Eades","year":"1993"},{"key":"10.1016\/S0925-7721(97)00016-3_BIB17","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1137\/0222063","article-title":"Drawing graphs in the plane with high resolution","volume":"22","author":"Formann","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(97)00016-3_BIB18","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0925-7721(97)00016-3_BIB19","series-title":"Proc. 9th Annu. ACM Sympos. Comput. Geom.","first-page":"359","article-title":"Area-efficient upward tree drawings","author":"Garg","year":"1993"},{"key":"10.1016\/S0925-7721(97)00016-3_BIB20","series-title":"Proc. 2nd Annu. European Sympos. Algorithms (ESA '94)","first-page":"12","article-title":"Planar drawings and angular resolution: Algorithms and bounds","volume":"855","author":"Garg","year":"1994"},{"key":"10.1016\/S0925-7721(97)00016-3_BIB21","series-title":"Graph Drawing, Proc. GD '96","article-title":"A new minimum cost flow algorithm with applications to graph drawing","author":"Garg","year":"1997"},{"key":"10.1016\/S0925-7721(97)00016-3_BIB22","series-title":"Comparing and evaluating layout algorithms within graphed, manuscript","author":"Himsolt","year":"1994"},{"issue":"3","key":"10.1016\/S0925-7721(97)00016-3_BIB23","doi-asserted-by":"crossref","DOI":"10.1006\/jvlc.1995.1015","article-title":"Comparing and evaluating layout algorithms within GraphEd","volume":"6","author":"Himsolt","year":"1995","journal-title":"J. Visual Languages and Computing"},{"issue":"4","key":"10.1016\/S0925-7721(97)00016-3_BIB24","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","article-title":"Efficient planarity testing","volume":"21","author":"Hopcroft","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/S0925-7721(97)00016-3_BIB25","article-title":"On visualization of abstract objects and relations","author":"Kamada","year":"1988"},{"key":"10.1016\/S0925-7721(97)00016-3_BIB26","series-title":"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci.","first-page":"101","article-title":"Drawing planar graphs using the lmc-ordering","author":"Kant","year":"1992"},{"key":"10.1016\/S0925-7721(97)00016-3_BIB27","article-title":"Algorithms for drawing planar graphs","author":"Kant","year":"1993"},{"key":"10.1016\/S0925-7721(97)00016-3_BIB28","series-title":"Proc 18th Internat. Workshop Graph-Theoret. Concepts Comput. Sci.","article-title":"Hexagonal grid drawings","author":"Kant","year":"1992"},{"key":"10.1016\/S0925-7721(97)00016-3_BIB29","series-title":"Proc. 21 st Annu. IEEE Sympos. Found. Comput. Sci.","first-page":"270","article-title":"Area-efficient graph layouts (for VLSI)","author":"Leiserson","year":"1980"},{"key":"10.1016\/S0925-7721(97)00016-3_BIB30","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0010-4485(81)90317-1","article-title":"Optimal space planning in practice","volume":"13","author":"Liggett","year":"1981","journal-title":"Computer Aided Design"},{"key":"10.1016\/S0925-7721(97)00016-3_BIB31","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1137\/S0895480193242931","article-title":"On the angular resolution of planar graphs","volume":"7","author":"Malitz","year":"1994","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0925-7721(97)00016-3_BIB32","series-title":"Graph Drawing, Proc. GD '94","first-page":"40","article-title":"Improved algorithms and bounds for orthogonal drawings","volume":"894","author":"Papakostas","year":"1995"},{"key":"10.1016\/S0925-7721(97)00016-3_BIB33","series-title":"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms","first-page":"138","article-title":"Embedding planar graphs on the grid","author":"Schnyder","year":"1990"},{"key":"10.1016\/S0925-7721(97)00016-3_BIB34","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/net.3230140202","article-title":"On minimal node-cost planar embeddings","volume":"14","author":"Storer","year":"1984","journal-title":"Networks"},{"issue":"3","key":"10.1016\/S0925-7721(97)00016-3_BIB35","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1137\/0216030","article-title":"On embedding a graph in the grid with the minimum number of bends","volume":"16","author":"Tamassia","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(97)00016-3_BIB36","series-title":"Automata, Languages and Programming, Proc. 15th ICALP","first-page":"576","article-title":"A dynamic data structure for planar graph embedding","volume":"317","author":"Tamassia","year":"1988"},{"issue":"4","key":"10.1016\/S0925-7721(97)00016-3_BIB37","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","article-title":"A unified approach to visibility representations of planar graphs","volume":"1","author":"Tamassia","year":"1986","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"10.1016\/S0925-7721(97)00016-3_BIB38","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","article-title":"Universality considerations in VLSI circuits","volume":"30","author":"Valiant","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0925-7721(97)00016-3_BIB39","series-title":"Proc. 2nd Annu. ACM Sympos. Comput. Geom.","first-page":"116","article-title":"Geometry of planar graphs with angles","author":"Vijayan","year":"1986"},{"key":"10.1016\/S0925-7721(97)00016-3_BIB40","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1137\/0214027","article-title":"Rectilinear graphs and their embeddings","volume":"14","author":"Vijayan","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(97)00016-3_BIB41","article-title":"Drawing planar graphs","author":"Woods","year":"1982"},{"key":"10.1016\/S0925-7721(97)00016-3_BIB42","unstructured":"also: Technical Report STAN-CS-82-943."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772197000163?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772197000163?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T03:27:20Z","timestamp":1555990040000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772197000163"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":42,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0925772197000163"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(97)00016-3","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}