• About
  • Policies
  • What is openaccess
  • 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.

      CiSE: a circular spring embedder layout algorithm

      Thumbnail
      View / Download
      1.5 Mb
      Author
      Dogrusoz, U.
      Belviranli, M. E.
      Dilek, A.
      Date
      2013
      Source Title
      IEEE Transactions on Visualization and Computer Graphics
      Print ISSN
      1077-2626
      Publisher
      Institute of Electrical and Electronics Engineers
      Volume
      19
      Issue
      6
      Pages
      953 - 966
      Language
      English
      Type
      Article
      Item Usage Stats
      140
      views
      1,725
      downloads
      Abstract
      We present a new algorithm for automatic layout of clustered graphs using a circular style. The algorithm tries to determine optimal location and orientation of individual clusters intrinsically within a modified spring embedder. Heuristics such as reversal of the order of nodes in a cluster and swap of neighboring node pairs in the same cluster are employed intermittently to further relax the spring embedder system, resulting in reduced inter-cluster edge crossings. Unlike other algorithms generating circular drawings, our algorithm does not require the quotient graph to be acyclic, nor does it sacrifice the edge crossing number of individual clusters to improve respective positioning of the clusters. Moreover, it reduces the total area required by a cluster by using the space inside the associated circle. Experimental results show that the execution time and quality of the produced drawings with respect to commonly accepted layout criteria are quite satisfactory, surpassing previous algorithms. The algorithm has also been successfully implemented and made publicly available as part of a compound and clustered graph editing and layout tool named Chisio. © 1995-2012 IEEE.
      Keywords
      Algorithm design and analysis
      Circular layout
      Graph algorithms
      Graph drawing
      Graph visualization
      Information visualization
      Algorithm design and analysis
      Clustered graph
      Force - directed layout
      Sequence alignments
      Visualization systems and software
      Visualization techniques and methodologies
      Directed graphs
      Drawing (graphics)
      Information systems
      Clustering algorithms
      Permalink
      http://hdl.handle.net/11693/21006
      Published Version (Please cite this version)
      http://dx.doi.org/10.1109/TVCG.2012.178
      Collections
      • Department of Computer Engineering 1368
      Show full item record

      Related items

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

      • Thumbnail

        Incremental k-core decomposition: algorithms and evaluation 

        Sarıyüce, A. E.; Gedik, B.; Jacques-Silva, G.; Wu, Kun-Lung; Catalyurek, U.V. (Association for Computing Machinery, 2016)
        A k-core of a graph is a maximal connected subgraph in which every vertex is connected to at least k vertices in the subgraph. k-core decomposition is often used in large-scale network analysis, such as community detection, ...
      • Thumbnail

        A compound graph layout algorithm with support for ports 

        Okka, Alihan (Bilkent University, 2020-11)
        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

        Two-dimensional packing algorithms for layout of disconnected graphs 

        Dogrusoz, U. (Elsevier, 2002)
        We present and contrast several efficient two-dimensional packing algorithms for specified aspect ratio. These near-linear algorithms are based on strip packing, tiling, and alternate-bisection methodologies and can be ...

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      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 1771
      Copyright © Bilkent University - Library IT

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