A compound graph layout algorithm with support for ports
Author(s)
Advisor
Doğrusöz, UğurDate
2020-10Publisher
Bilkent University
Language
English
Type
ThesisItem Usage Stats
251
views
views
282
downloads
downloads
Abstract
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 discovery of unstructured
insights that are limited to human cognition via visual depictions.
Complex systems and processes are often modelled as graphs since it would be
di cult to describe in text. A type of visualization, graph drawing, addresses
the notion of creating geometric representations of graphs. There are plentiful
research directed to designing automatic layout algorithms for visualizing graphs.
Nevertheless, a limited number of studies utilize ports, which are dedicated connection
points on the locations where edge ends link to their incident nodes.
We propose a new automatic layout algorithm named CoSEP supporting port
constraints on compound nodes used for nested levels of abstractions in data.
The CoSEP algorithm is based on a force-directed algorithm, Compound Spring
Embedder (CoSE). Additional heuristics and force types are introduced on top
of existing physical model. Using CoSE's layout structure as a baseline enables
CoSEP to handle non-uniform node sizes, arbitrary levels of nesting, and intergraph
edges that may span multiple levels of nesting. Our experiments show that
CoSEP signi cantly improves the quality of the layouts for compound graphs
with port constraints with respect to commonly accepted graph drawing criteria,
while running in at most a few seconds, suitable for use in interactive applications
for small to medium sized graphs. The CoSEP algorithm is implemented
in JavaScript as a Cytoscape.js extension, and the sources along with a demo are
available on the associated GitHub repository.
Keywords
Information visualizationGraph visualization
Graph drawing
Graph layout
Force directed graph layout
Compound graphs
Graph algorithms
Port constraints
Permalink
http://hdl.handle.net/11693/54406Collections
Related items
Showing items related by title, author, creator and subject.
-
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 ... -
CoSEP: a compound spring embedder layout algorithm with support for ports
Okka, Alihan; Doğrusöz, Uğur; Balcı, Hasan (Sage Publications, 2021-07-01)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 ... -
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 ...