CoSEP: A compound spring embedder layout algorithm with support for ports

CoSEP: A compound spring embedder layout algorithm with support for ports

This paper describes a new automatic layout algorithm named CoSEP for compound graphs with port constraints. The algorithm works by extending the physical model of a previous algorithm named CoSE by defining additional force types and heuristics for constraining edges to connect to certain user-defi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information visualization 2021-07, Vol.20 (2-3), p.151-169
Hauptverfasser: Okka, Alihan, Dogrusoz, Ugur, Balci, Hasan
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Graphs
Layouts
Nesting
Nodes
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 169
container_issue 2-3
container_start_page 151
container_title Information visualization
container_volume 20
creator Okka, Alihan
Dogrusoz, Ugur
Balci, Hasan
description This paper describes a new automatic layout algorithm named CoSEP for compound graphs with port constraints. The algorithm works by extending the physical model of a previous algorithm named CoSE by defining additional force types and heuristics for constraining edges to connect to certain user-defined locations on end nodes. Similar to its predecessor, CoSEP also accounts for non-uniform node dimensions and arbitrary levels of nesting via compound nodes. Our experiments show that CoSEP significantly improves the quality of the layouts for compound graphs with port constraints with respect to commonly accepted graph drawing criteria while running reasonably fast, suitable for use in interactive applications for small to medium-sized (up to 500 nodes) graphs. A complete JavaScript implementation of CoSEP as a Cytoscape.js extension along with a demo page is freely available at https://github.com/iVis-at-Bilkent/cytoscape.js-cosep.
doi_str_mv 10.1177/14738716211028136
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2561208619</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sage_id>10.1177_14738716211028136</sage_id><sourcerecordid>2561208619</sourcerecordid><originalsourceid>FETCH-LOGICAL-c355t-e93044b7f20050c5bf4aff84b6b6dc51b93708ed2434f20e6ebcd515fe0c2f63</originalsourceid><addsrcrecordid>eNp1UE1Lw0AQXUTBWv0B3hY8p87sZ-KtlKqFgoK9h-xmt7Y03bibIP33plT0IF5mHsP7YB4htwgTRK3vUWiea1QMEViOXJ2R0fGW5ZqJ8x-M6pJcpbQFYFpAMSKLWXibvz7QKbWhaUO_r2lq42a_pq4xrq5dpLvqEPqOVrt1iJvuvaGfw6Spb9sQO-pDpEeQrsmFr3bJ3XzvMVk9zlez52z58rSYTZeZ5VJ2mSs4CGG0ZwASrDReVN7nwiijaivRFFxD7momuBg4Tjlja4nSO7DMKz4mdyfbNoaP3qWu3IY-7ofEkkmFDHKFxcDCE8vGkFJ0vhyeaqp4KBHKY2Hln8IGzeSkSdXa_br-L_gCqGFqYA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2561208619</pqid></control><display><type>article</type><title>CoSEP: A compound spring embedder layout algorithm with support for ports</title><source>Access via SAGE</source><creator>Okka, Alihan ; Dogrusoz, Ugur ; Balci, Hasan</creator><creatorcontrib>Okka, Alihan ; Dogrusoz, Ugur ; Balci, Hasan</creatorcontrib><description>This paper describes a new automatic layout algorithm named CoSEP for compound graphs with port constraints. The algorithm works by extending the physical model of a previous algorithm named CoSE by defining additional force types and heuristics for constraining edges to connect to certain user-defined locations on end nodes. Similar to its predecessor, CoSEP also accounts for non-uniform node dimensions and arbitrary levels of nesting via compound nodes. Our experiments show that CoSEP significantly improves the quality of the layouts for compound graphs with port constraints with respect to commonly accepted graph drawing criteria while running reasonably fast, suitable for use in interactive applications for small to medium-sized (up to 500 nodes) graphs. A complete JavaScript implementation of CoSEP as a Cytoscape.js extension along with a demo page is freely available at https://github.com/iVis-at-Bilkent/cytoscape.js-cosep.</description><identifier>ISSN: 1473-8716</identifier><identifier>EISSN: 1473-8724</identifier><identifier>DOI: 10.1177/14738716211028136</identifier><language>eng</language><publisher>London, England: SAGE Publications</publisher><subject>Algorithms ; Graphs ; Layouts ; Nesting ; Nodes</subject><ispartof>Information visualization, 2021-07, Vol.20 (2-3), p.151-169</ispartof><rights>The Author(s) 2021</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c355t-e93044b7f20050c5bf4aff84b6b6dc51b93708ed2434f20e6ebcd515fe0c2f63</citedby><cites>FETCH-LOGICAL-c355t-e93044b7f20050c5bf4aff84b6b6dc51b93708ed2434f20e6ebcd515fe0c2f63</cites><orcidid>0000-0001-8319-7758 ; 0000-0002-4402-5993 ; 0000-0002-7153-0784</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://journals.sagepub.com/doi/pdf/10.1177/14738716211028136$$EPDF$$P50$$Gsage$$H</linktopdf><linktohtml>$$Uhttps://journals.sagepub.com/doi/10.1177/14738716211028136$$EHTML$$P50$$Gsage$$H</linktohtml><link.rule.ids>314,780,784,21819,27924,27925,43621,43622</link.rule.ids></links><search><creatorcontrib>Okka, Alihan</creatorcontrib><creatorcontrib>Dogrusoz, Ugur</creatorcontrib><creatorcontrib>Balci, Hasan</creatorcontrib><title>CoSEP: A compound spring embedder layout algorithm with support for ports</title><title>Information visualization</title><description>This paper describes a new automatic layout algorithm named CoSEP for compound graphs with port constraints. The algorithm works by extending the physical model of a previous algorithm named CoSE by defining additional force types and heuristics for constraining edges to connect to certain user-defined locations on end nodes. Similar to its predecessor, CoSEP also accounts for non-uniform node dimensions and arbitrary levels of nesting via compound nodes. Our experiments show that CoSEP significantly improves the quality of the layouts for compound graphs with port constraints with respect to commonly accepted graph drawing criteria while running reasonably fast, suitable for use in interactive applications for small to medium-sized (up to 500 nodes) graphs. A complete JavaScript implementation of CoSEP as a Cytoscape.js extension along with a demo page is freely available at https://github.com/iVis-at-Bilkent/cytoscape.js-cosep.</description><subject>Algorithms</subject><subject>Graphs</subject><subject>Layouts</subject><subject>Nesting</subject><subject>Nodes</subject><issn>1473-8716</issn><issn>1473-8724</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><recordid>eNp1UE1Lw0AQXUTBWv0B3hY8p87sZ-KtlKqFgoK9h-xmt7Y03bibIP33plT0IF5mHsP7YB4htwgTRK3vUWiea1QMEViOXJ2R0fGW5ZqJ8x-M6pJcpbQFYFpAMSKLWXibvz7QKbWhaUO_r2lq42a_pq4xrq5dpLvqEPqOVrt1iJvuvaGfw6Spb9sQO-pDpEeQrsmFr3bJ3XzvMVk9zlez52z58rSYTZeZ5VJ2mSs4CGG0ZwASrDReVN7nwiijaivRFFxD7momuBg4Tjlja4nSO7DMKz4mdyfbNoaP3qWu3IY-7ofEkkmFDHKFxcDCE8vGkFJ0vhyeaqp4KBHKY2Hln8IGzeSkSdXa_br-L_gCqGFqYA</recordid><startdate>202107</startdate><enddate>202107</enddate><creator>Okka, Alihan</creator><creator>Dogrusoz, Ugur</creator><creator>Balci, Hasan</creator><general>SAGE Publications</general><general>SAGE PUBLICATIONS, INC</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>E3H</scope><scope>F2A</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0001-8319-7758</orcidid><orcidid>https://orcid.org/0000-0002-4402-5993</orcidid><orcidid>https://orcid.org/0000-0002-7153-0784</orcidid></search><sort><creationdate>202107</creationdate><title>CoSEP: A compound spring embedder layout algorithm with support for ports</title><author>Okka, Alihan ; Dogrusoz, Ugur ; Balci, Hasan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c355t-e93044b7f20050c5bf4aff84b6b6dc51b93708ed2434f20e6ebcd515fe0c2f63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>Graphs</topic><topic>Layouts</topic><topic>Nesting</topic><topic>Nodes</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Okka, Alihan</creatorcontrib><creatorcontrib>Dogrusoz, Ugur</creatorcontrib><creatorcontrib>Balci, Hasan</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Library &amp; Information Sciences Abstracts (LISA)</collection><collection>Library &amp; Information Science Abstracts (LISA)</collection><collection>ProQuest Computer Science Collection</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>Information visualization</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Okka, Alihan</au><au>Dogrusoz, Ugur</au><au>Balci, Hasan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>CoSEP: A compound spring embedder layout algorithm with support for ports</atitle><jtitle>Information visualization</jtitle><date>2021-07</date><risdate>2021</risdate><volume>20</volume><issue>2-3</issue><spage>151</spage><epage>169</epage><pages>151-169</pages><issn>1473-8716</issn><eissn>1473-8724</eissn><abstract>This paper describes a new automatic layout algorithm named CoSEP for compound graphs with port constraints. The algorithm works by extending the physical model of a previous algorithm named CoSE by defining additional force types and heuristics for constraining edges to connect to certain user-defined locations on end nodes. Similar to its predecessor, CoSEP also accounts for non-uniform node dimensions and arbitrary levels of nesting via compound nodes. Our experiments show that CoSEP significantly improves the quality of the layouts for compound graphs with port constraints with respect to commonly accepted graph drawing criteria while running reasonably fast, suitable for use in interactive applications for small to medium-sized (up to 500 nodes) graphs. A complete JavaScript implementation of CoSEP as a Cytoscape.js extension along with a demo page is freely available at https://github.com/iVis-at-Bilkent/cytoscape.js-cosep.</abstract><cop>London, England</cop><pub>SAGE Publications</pub><doi>10.1177/14738716211028136</doi><tpages>19</tpages><orcidid>https://orcid.org/0000-0001-8319-7758</orcidid><orcidid>https://orcid.org/0000-0002-4402-5993</orcidid><orcidid>https://orcid.org/0000-0002-7153-0784</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1473-8716
ispartof Information visualization, 2021-07, Vol.20 (2-3), p.151-169
issn 1473-8716
1473-8724
language eng
recordid cdi_proquest_journals_2561208619
source Access via SAGE
subjects Algorithms
Graphs
Layouts
Nesting
Nodes
title CoSEP: A compound spring embedder layout algorithm with support for ports
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T15%3A44%3A23IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=CoSEP:%20A%20compound%20spring%20embedder%20layout%20algorithm%20with%20support%20for%20ports&rft.jtitle=Information%20visualization&rft.au=Okka,%20Alihan&rft.date=2021-07&rft.volume=20&rft.issue=2-3&rft.spage=151&rft.epage=169&rft.pages=151-169&rft.issn=1473-8716&rft.eissn=1473-8724&rft_id=info:doi/10.1177/14738716211028136&rft_dat=%3Cproquest_cross%3E2561208619%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2561208619&rft_id=info:pmid/&rft_sage_id=10.1177_14738716211028136&rfr_iscdi=true