{"id":"https://openalex.org/W2139793058","doi":"https://doi.org/10.1142/s0218195996000228","title":"PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA","display_name":"PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA","publication_year":1996,"publication_date":"1996-09-01","ids":{"openalex":"https://openalex.org/W2139793058","doi":"https://doi.org/10.1142/s0218195996000228","mag":"2139793058"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195996000228","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195996000228","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry &amp; Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016725153","display_name":"Ashim Garg","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"ASHIM GARG","raw_affiliation_strings":["Dept. of Computer Science, Brown University, Providence, RI, USA 02912\u20131910, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Brown University, Providence, RI, USA 02912\u20131910, USA","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034971300","display_name":"Michael T. Goodrich","orcid":"https://orcid.org/0000-0002-8943-191X"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"MICHAEL T. GOODRICH","raw_affiliation_strings":["Dept. of Computer Science, The Johns Hopkins University, Baltimore, MD, USA 21218\u20132694, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, The Johns Hopkins University, Baltimore, MD, USA 21218\u20132694, USA","institution_ids":["https://openalex.org/I145311948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079716343","display_name":"Roberto Tamassia","orcid":"https://orcid.org/0000-0003-2445-6064"},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"ROBERTO TAMASSIA","raw_affiliation_strings":["Dept. of Computer Science, Brown University, Providence, RI, USA 02912\u20131910, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Brown University, Providence, RI, USA 02912\u20131910, USA","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.0774,"has_fulltext":false,"cited_by_count":64,"citation_normalized_percentile":{"value":0.91089788,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"06","issue":"03","first_page":"333","last_page":"356"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9778000116348267,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.974399983882904,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7997472286224365},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.7761385440826416},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7514063119888306},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5832981467247009},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5782281756401062},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5703303813934326},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5480039119720459},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5270949602127075},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39127442240715027},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.3422466516494751},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14938566088676453},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09011447429656982},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.06095743179321289},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.0598699152469635}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7997472286224365},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.7761385440826416},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7514063119888306},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5832981467247009},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5782281756401062},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5703303813934326},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5480039119720459},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5270949602127075},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39127442240715027},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.3422466516494751},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14938566088676453},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09011447429656982},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06095743179321289},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0598699152469635}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1142/s0218195996000228","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195996000228","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry &amp; Applications","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.50.9110","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.9110","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.jhu.edu/~goodrich/pubs/trees.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.52.2395","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.2395","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.brown.edu/pub/papers/compgeo/treedraw-full.ps.Z","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.9.6173","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.6173","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.brown.edu/cgc/papers/ggt-aoutd-96.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.91.6903","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.6903","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.brown.edu/research/pubs/pdfs/1996/Garg-1996-PUT.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4221142572","https://openalex.org/W2262241524","https://openalex.org/W2278572068","https://openalex.org/W2922479330","https://openalex.org/W3036401461","https://openalex.org/W2137862244","https://openalex.org/W2052136967","https://openalex.org/W3114148850","https://openalex.org/W3101621653","https://openalex.org/W1596762683"],"abstract_inverted_index":{"Rooted":[0],"trees":[1,212],"are":[2,70,167],"usually":[3],"drawn":[4],"planar":[5,28,81,116,142,205],"and":[6,11,38,49,89],"upward,":[7],"i.e.,":[8],"without":[9],"crossings":[10],"with-out":[12],"any":[13,96],"parent":[14],"placed":[15],"below":[16],"its":[17],"child.":[18],"In":[19],"this":[20],"paper":[21],"we":[22,110],"investigate":[23],"the":[24,42,148,152,163,171,183,198],"area":[25,43,56,87,122,165],"requirement":[26],"of":[27,31,44,47,151,154,162,182,186,188,200],"upward":[29,83,118,143,207],"drawings":[30,187],"rooted":[32,63],"trees.":[33],"We":[34,75,129,158,175,195],"give":[35],"tight":[36],"upper":[37],"lower":[39],"bounds":[40,166],"on":[41,197,211],"various":[45],"types":[46,185],"drawings,":[48,209],"provide":[50],"linear-time":[51],"algorithms":[52,178],"for":[53,95,179,203],"constructing":[54,180,204],"optimal":[55,169,192],"drawings.":[57],"Let":[58],"T":[59,78,105,113,133,189],"be":[60],"a":[61,80,99,107,115],"bounded-degree":[62],"tree":[64],"with":[65,86,90,121,190,213],"N":[66],"nodes.":[67,218],"Our":[68],"results":[69],"summarized":[71],"as":[72],"follows:":[73],"\u2022":[74,103,128,157,174,194],"show":[76,111,130,159],"that":[77,101,112,131,146,160],"admits":[79,114,137],"polyline":[82,206],"grid":[84,119,144,208],"drawing":[85,120,145],"O(N),":[88],"width":[91],"O(N":[92,139],"\u03b1":[93],")":[94],"prespecified":[97],"constant":[98],"such":[100],"0<\u03b1<1.":[102],"If":[104],"is":[106,134],"binary":[108],"tree,":[109],"orthogonal":[117],"O":[123],"(N":[124],"log":[125,126,140],"N).":[127],"if":[132],"ordered,":[135],"it":[136],"an":[138],"N)-area":[141],"preserves":[147],"left-to-right":[149],"ordering":[150],"children":[153],"each":[155,181],"node.":[156],"all":[161],"above":[164,184],"asymptotically":[168,191],"in":[170],"worst":[172],"case.":[173],"present":[176],"O(N)-time":[177],"area.":[193],"report":[196],"experimentation":[199],"our":[201],"algorithm":[202],"performed":[210],"up":[214],"to":[215],"24":[216],"million":[217]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}