{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:19:15Z","timestamp":1758269955757},"reference-count":11,"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":[[2003,12]]},"abstract":"<jats:p> Ordered trees are generally drawn using order-preserving planar straight-line grid drawings. We investigate the area-requirements of such drawings and present several results. Let T be an ordered tree with n nodes. We show that: <\/jats:p><jats:p> \u2022 T admits an order-preserving planar straight-line grid drawing with O(n log n) area. <\/jats:p><jats:p> \u2022 If T is a binary tree, then T admits an order-preserving planar straight-line grid drawing with O(n log log n) area. <\/jats:p><jats:p> \u2022 If T is a binary tree, then T admits an order-preserving upward planar straight-line grid drawing with optimalO(n log n) area. <\/jats:p><jats:p> We also study the problem of drawing binary trees with user-specified aspect ratios. We show that an ordered binary tree T with n nodes admits an order-preserving planar straight-line grid drawing with area O(n log n), and any user-specified aspect ratio in the range [1,n\/ log n]. All the drawings mentioned above can be constructed in O(n) time. <\/jats:p>","DOI":"10.1142\/s021819590300130x","type":"journal-article","created":{"date-parts":[[2004,2,12]],"date-time":"2004-02-12T10:51:06Z","timestamp":1076583066000},"page":"487-505","source":"Crossref","is-referenced-by-count":12,"title":["AREA-EFFICIENT ORDER-PRESERVING PLANAR STRAIGHT-LINE  DRAWINGS OF ORDERED TREES"],"prefix":"10.1142","volume":"13","author":[{"given":"ASHIM","family":"GARG","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering,  University at Buffalo, Buffalo, New York 14260, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ADRIAN","family":"RUSU","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Rowan University,  201 Mullica Hill Road, Glassboro, New Jersey 08028, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-002-0937-x"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(01)00066-9"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(92)90021-J"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00287-9"},{"key":"rf5","volume-title":"Graph Drawing","author":"Di Battista G.","year":"1999"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195996000228"},{"key":"rf7","volume-title":"Journal of Graph Algorithms and Applications (JGAA), special issue on selected papers from the 10th International Symposium on Graph Drawing (GD 2002)","author":"Garg A."},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36151-0_30"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44842-X_89"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(99)00053-X"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(96)81422-0"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S021819590300130X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:28:46Z","timestamp":1565137726000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S021819590300130X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":11,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2003,12]]}},"alternative-id":["10.1142\/S021819590300130X"],"URL":"https:\/\/doi.org\/10.1142\/s021819590300130x","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}