INKA: An Ink-based Model of Graph Visualization

01/22/2018
by   Quan Hoang Nguyen, et al.
0

Common quality metrics of graph drawing have been about the readability criteria, such as small number of edge crossings, small drawing area and small total edge length. Bold graph drawing considers more realistic drawings consisting of vertices as disks of some radius and edges as rectangles of some width. However, the relationship that links these readability criteria with the rendering criteria in node-link diagrams has still not been well-established. This paper introduces a model, so-called INKA (Ink-Active), that encapsulates mathematically the relationship between all common drawing factors. Consequently, we investigate our INKA model on several common drawing algorithms and real-world graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/27/2021

One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons

We consider the problem of drawing an outerplanar graph with n vertices ...
research
07/24/2021

RAC-drawability is ∃ℝ-complete

A RAC-drawing of a graph is a straight-line drawing in which every cross...
research
09/04/2023

A Simple Pipeline for Orthogonal Graph Drawing

Orthogonal graph drawing has many applications, e.g., for laying out UML...
research
08/05/2019

Geometry and Generation of a New Graph Planarity Game

We introduce a new abstract graph game, Swap Planarity, where the goal i...
research
08/05/2019

Graph Drawing with Morphing Partial Edges

A partial edge drawing (PED) of a graph is a variation of a node-link di...
research
07/24/2018

Graph Compact Orthogonal Layout Algorithm

There exist many orthogonal graph drawing algorithms that minimize edge ...
research
08/12/2020

Graph Drawing via Gradient Descent, (GD)^2

Readability criteria, such as distance or neighborhood preservation, are...

Please sign up or login with your details

Forgot password? Click here to reset