Tidier Drawings of Trees
Various algorithms have been proposed for producing tidy drawings of trees-drawings that are aesthetically pleasing and use minimum drawing space. We show that these algorithms contain some difficulties that lead to aesthetically unpleasing, wider than necessary drawings. We then present a new algor...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on software engineering 1981-03, Vol.SE-7 (2), p.223-228 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 228 |
|---|---|
| container_issue | 2 |
| container_start_page | 223 |
| container_title | IEEE transactions on software engineering |
| container_volume | SE-7 |
| creator | Reingold, E.M. Tilford, J.S. |
| description | Various algorithms have been proposed for producing tidy drawings of trees-drawings that are aesthetically pleasing and use minimum drawing space. We show that these algorithms contain some difficulties that lead to aesthetically unpleasing, wider than necessary drawings. We then present a new algorithm with comparable time and storage requirements that produces tidier drawings. Generalizations to forests and m-ary trees are discussed, as are some problems in discretization when alphanumeric output devices are used. |
| doi_str_mv | 10.1109/TSE.1981.234519 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_195581065</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1702828</ieee_id><sourcerecordid>743494210</sourcerecordid><originalsourceid>FETCH-LOGICAL-c318t-1f47a109101b0233f22494f795a7e6b0bc487404fe36c92a178ccd59ce16568f3</originalsourceid><addsrcrecordid>eNpdkE1LAzEQhoMoWKtnBS_Fi6dtZ_KxSY5S6wcUPLieQ5pOZEvbrUmL-O-NrCB4msvzvjPzMHaJMEYEO2leZ2O0BsdcSIX2iA3QClsJxeGYDQCsqZQy9pSd5bwCAKW1GrCrpl22lEb3yX-22_c86uKoSUT5nJ1Ev8508TuH7O1h1kyfqvnL4_P0bl4FgWZfYZTal_UIuAAuRORcWhm1VV5TvYBFkEZLkJFEHSz3qE0IS2UDYa1qE8WQ3fa9u9R9HCjv3abNgdZrv6XukJ2WohRyhELe_CNX3SFty3EObXkNoVYFmvRQSF3OiaLbpXbj05dDcD-eXPHkfjy53lNJXPeJloj-aA3ccCO-Ab8lX-o</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>195581065</pqid></control><display><type>article</type><title>Tidier Drawings of Trees</title><source>IEEE Electronic Library (IEL)</source><creator>Reingold, E.M. ; Tilford, J.S.</creator><creatorcontrib>Reingold, E.M. ; Tilford, J.S.</creatorcontrib><description>Various algorithms have been proposed for producing tidy drawings of trees-drawings that are aesthetically pleasing and use minimum drawing space. We show that these algorithms contain some difficulties that lead to aesthetically unpleasing, wider than necessary drawings. We then present a new algorithm with comparable time and storage requirements that produces tidier drawings. Generalizations to forests and m-ary trees are discussed, as are some problems in discretization when alphanumeric output devices are used.</description><identifier>ISSN: 0098-5589</identifier><identifier>EISSN: 1939-3520</identifier><identifier>DOI: 10.1109/TSE.1981.234519</identifier><identifier>CODEN: IESEDJ</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Aesthetics ; Algorithms ; Binary trees ; Computer programming ; Computer science ; Data ; Data structures ; Engineering drawings ; Linear programming ; Printing ; Software algorithms ; Software engineering ; Structure ; Tree data structures ; tree structures ; trees</subject><ispartof>IEEE transactions on software engineering, 1981-03, Vol.SE-7 (2), p.223-228</ispartof><rights>Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Mar 1981</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c318t-1f47a109101b0233f22494f795a7e6b0bc487404fe36c92a178ccd59ce16568f3</citedby><cites>FETCH-LOGICAL-c318t-1f47a109101b0233f22494f795a7e6b0bc487404fe36c92a178ccd59ce16568f3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1702828$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1702828$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Reingold, E.M.</creatorcontrib><creatorcontrib>Tilford, J.S.</creatorcontrib><title>Tidier Drawings of Trees</title><title>IEEE transactions on software engineering</title><addtitle>TSE</addtitle><description>Various algorithms have been proposed for producing tidy drawings of trees-drawings that are aesthetically pleasing and use minimum drawing space. We show that these algorithms contain some difficulties that lead to aesthetically unpleasing, wider than necessary drawings. We then present a new algorithm with comparable time and storage requirements that produces tidier drawings. Generalizations to forests and m-ary trees are discussed, as are some problems in discretization when alphanumeric output devices are used.</description><subject>Aesthetics</subject><subject>Algorithms</subject><subject>Binary trees</subject><subject>Computer programming</subject><subject>Computer science</subject><subject>Data</subject><subject>Data structures</subject><subject>Engineering drawings</subject><subject>Linear programming</subject><subject>Printing</subject><subject>Software algorithms</subject><subject>Software engineering</subject><subject>Structure</subject><subject>Tree data structures</subject><subject>tree structures</subject><subject>trees</subject><issn>0098-5589</issn><issn>1939-3520</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1981</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>BENPR</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNpdkE1LAzEQhoMoWKtnBS_Fi6dtZ_KxSY5S6wcUPLieQ5pOZEvbrUmL-O-NrCB4msvzvjPzMHaJMEYEO2leZ2O0BsdcSIX2iA3QClsJxeGYDQCsqZQy9pSd5bwCAKW1GrCrpl22lEb3yX-22_c86uKoSUT5nJ1Ev8508TuH7O1h1kyfqvnL4_P0bl4FgWZfYZTal_UIuAAuRORcWhm1VV5TvYBFkEZLkJFEHSz3qE0IS2UDYa1qE8WQ3fa9u9R9HCjv3abNgdZrv6XukJ2WohRyhELe_CNX3SFty3EObXkNoVYFmvRQSF3OiaLbpXbj05dDcD-eXPHkfjy53lNJXPeJloj-aA3ccCO-Ab8lX-o</recordid><startdate>19810301</startdate><enddate>19810301</enddate><creator>Reingold, E.M.</creator><creator>Tilford, J.S.</creator><general>IEEE</general><general>IEEE Computer Society</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X7</scope><scope>7XB</scope><scope>87Z</scope><scope>88E</scope><scope>88F</scope><scope>88I</scope><scope>88K</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>FYUFA</scope><scope>F~G</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>K9.</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M0S</scope><scope>M1P</scope><scope>M1Q</scope><scope>M2O</scope><scope>M2P</scope><scope>M2T</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>F28</scope><scope>FR3</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19810301</creationdate><title>Tidier Drawings of Trees</title><author>Reingold, E.M. ; Tilford, J.S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c318t-1f47a109101b0233f22494f795a7e6b0bc487404fe36c92a178ccd59ce16568f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1981</creationdate><topic>Aesthetics</topic><topic>Algorithms</topic><topic>Binary trees</topic><topic>Computer programming</topic><topic>Computer science</topic><topic>Data</topic><topic>Data structures</topic><topic>Engineering drawings</topic><topic>Linear programming</topic><topic>Printing</topic><topic>Software algorithms</topic><topic>Software engineering</topic><topic>Structure</topic><topic>Tree data structures</topic><topic>tree structures</topic><topic>trees</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Reingold, E.M.</creatorcontrib><creatorcontrib>Tilford, J.S.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>Health & Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Medical Database (Alumni Edition)</collection><collection>Military Database (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Telecommunications (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>Health Research Premium Collection</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Health & Medical Complete (Alumni)</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Health & Medical Collection (Alumni Edition)</collection><collection>Medical Database</collection><collection>Military Database</collection><collection>Research Library</collection><collection>Science Database</collection><collection>Telecommunications Database</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on software engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Reingold, E.M.</au><au>Tilford, J.S.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Tidier Drawings of Trees</atitle><jtitle>IEEE transactions on software engineering</jtitle><stitle>TSE</stitle><date>1981-03-01</date><risdate>1981</risdate><volume>SE-7</volume><issue>2</issue><spage>223</spage><epage>228</epage><pages>223-228</pages><issn>0098-5589</issn><eissn>1939-3520</eissn><coden>IESEDJ</coden><abstract>Various algorithms have been proposed for producing tidy drawings of trees-drawings that are aesthetically pleasing and use minimum drawing space. We show that these algorithms contain some difficulties that lead to aesthetically unpleasing, wider than necessary drawings. We then present a new algorithm with comparable time and storage requirements that produces tidier drawings. Generalizations to forests and m-ary trees are discussed, as are some problems in discretization when alphanumeric output devices are used.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TSE.1981.234519</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0098-5589 |
| ispartof | IEEE transactions on software engineering, 1981-03, Vol.SE-7 (2), p.223-228 |
| issn | 0098-5589 1939-3520 |
| language | eng |
| recordid | cdi_proquest_journals_195581065 |
| source | IEEE Electronic Library (IEL) |
| subjects | Aesthetics Algorithms Binary trees Computer programming Computer science Data Data structures Engineering drawings Linear programming Printing Software algorithms Software engineering Structure Tree data structures tree structures trees |
| title | Tidier Drawings of Trees |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T13%3A48%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Tidier%20Drawings%20of%20Trees&rft.jtitle=IEEE%20transactions%20on%20software%20engineering&rft.au=Reingold,%20E.M.&rft.date=1981-03-01&rft.volume=SE-7&rft.issue=2&rft.spage=223&rft.epage=228&rft.pages=223-228&rft.issn=0098-5589&rft.eissn=1939-3520&rft.coden=IESEDJ&rft_id=info:doi/10.1109/TSE.1981.234519&rft_dat=%3Cproquest_RIE%3E743494210%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=195581065&rft_id=info:pmid/&rft_ieee_id=1702828&rfr_iscdi=true |