• About
  • Policies
  • What is open access
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

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

      Thumbnail
      View / Download
      5.9 Mb
      Author(s)
      Okka, Alihan
      Doğrusöz, Uğur
      Balcı, Hasan
      Date
      2021-07-01
      Source Title
      Information Visualization
      Print ISSN
      1473-8716
      Electronic ISSN
      1473-8724
      Publisher
      Sage Publications
      Volume
      20
      Issue
      2-3
      Pages
      151 - 169
      Language
      English
      Type
      Article
      Item Usage Stats
      67
      views
      74
      downloads
      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.
      Keywords
      Graph visualization
      Graph layout
      Force directed graph layout
      Compound graphs
      Graphs with ports
      Graph algorithms
      Permalink
      http://hdl.handle.net/11693/77233
      Published Version (Please cite this version)
      https://doi.org/10.1177/14738716211028136
      Collections
      • Department of Computer Engineering 1510
      Show full item record

      Related items

      Showing items related by title, author, creator and subject.

      • Thumbnail

        Exploiting locality in sparse matrix-matrix multiplication on many-core rchitectures 

        Akbudak K.; Aykanat, Cevdet (IEEE Computer Society, 2017)
        Exploiting spatial and temporal localities is investigated for efficient row-by-row parallelization of general sparse matrix-matrix multiplication (SpGEMM) operation of the form C=A,B on many-core architectures. Hypergraph ...
      • Thumbnail

        A compound graph layout algorithm with support for ports 

        Okka, Alihan (Bilkent University, 2020-10)
        Information visualization is a eld of study that aims to represent abstract data in an aesthetically pleasing and easy to comprehend visual manner. Various approaches and standards have been created to reinforce the ...
      • Thumbnail

        Generating time-varying road network data using sparse trajectories 

        Eser, Elif; Kocayusufoğlu, F.; Eravci, Bahaedd; Ferhatosmanoglu, Hakan; Larriba-Pey, J. L. (IEEE, 2016-12)
        While research on time-varying graphs has attracted recent attention, the research community has limited or no access to real datasets to develop effective algorithms and systems. Using noisy and sparse GPS traces from ...

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCoursesThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCourses

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 2976
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy