scholarly journals Graph Drawing Contest Report

2013 ◽  
pp. 508-513
Author(s):  
Christian A. Duncan ◽  
Carsten Gutwenger ◽  
Lev Nachmanson ◽  
Georg Sander
Keyword(s):  
Graph Drawing

Louvain-based Multi-level Graph Drawing

2021 ◽  
Author(s):  
Seok-Hee Hong ◽  
Peter Eades ◽  
Marnijati Torkel ◽  
James Wood ◽  
Kunsoo Park
Keyword(s):  
Graph Drawing ◽  
Multi Level

scholarly journals Data-driven graph drawing techniques with applications for conveyor systems

2020 ◽  
Vol 10 (1) ◽  
Author(s):  
Simone Göttlich ◽  
Sven Spieckermann ◽  
Stephan Stauber ◽  
Andrea Storck
Keyword(s):  
Real World ◽  
Connected Graph ◽  
Stress Function ◽  
Graph Drawing ◽  
Point Of View ◽  
Data Driven ◽  
Challenging Problem ◽  
Conveyor System ◽  
System Graph ◽  
Real World Problems

AbstractThe visualization of conveyor systems in the sense of a connected graph is a challenging problem. Starting from communication data provided by the IT system, graph drawing techniques are applied to generate an appealing layout of the conveyor system. From a mathematical point of view, the key idea is to use the concept of stress majorization to minimize a stress function over the positions of the nodes in the graph. Different to the already existing literature, we have to take care of special features inspired by the real-world problems.

scholarly journals Graph-Drawing Contest Report

2002 ◽  
pp. 376-379 ◽  
Author(s):  
Franz J. Brandenburg
Keyword(s):  
Graph Drawing

scholarly journals Optimal Orthogonal Graph Drawing with Convex Bend Costs

2016 ◽  
Vol 12 (3) ◽  
pp. 1-32 ◽  
Author(s):  
Thomas Bläsius ◽  
Ignaz Rutter ◽  
Dorothea Wagner
Keyword(s):  
Graph Drawing

scholarly journals Three-dimensional orthogonal graph drawing algorithms

2000 ◽  
Vol 103 (1-3) ◽  
pp. 55-87 ◽  
Author(s):  
Peter Eades ◽  
Antonios Symvonis ◽  
Sue Whitesides
Keyword(s):  
Graph Drawing ◽  
Three Dimensional

scholarly journals Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions

2017 ◽  
Vol 27 (01n02) ◽  
pp. 121-158 ◽  
Author(s):  
Martin Nöllenburg ◽  
Roman Prutkin ◽  
Ignaz Rutter
Keyword(s):  
Routing Protocol ◽  
Graph Drawing ◽  
Geographic Routing ◽  
Np Hard ◽  
Line Drawings ◽  
Simple Polygons ◽  
Straight Line ◽  
Starting Point ◽  
Minimum Decomposition ◽  
Geographic Routing Protocol

A greedily routable region (GRR) is a closed subset of [Formula: see text], in which any destination point can be reached from any starting point by always moving in the direction with maximum reduction of the distance to the destination in each point of the path. Recently, Tan and Kermarrec proposed a geographic routing protocol for dense wireless sensor networks based on decomposing the network area into a small number of interior-disjoint GRRs. They showed that minimum decomposition is NP-hard for polygonal regions with holes. We consider minimum GRR decomposition for plane straight-line drawings of graphs. Here, GRRs coincide with self-approaching drawings of trees, a drawing style which has become a popular research topic in graph drawing. We show that minimum decomposition is still NP-hard for graphs with cycles and even for trees, but can be solved optimally for trees in polynomial time, if we allow only certain types of GRR contacts. Additionally, we give a 2-approximation for simple polygons, if a given triangulation has to be respected.

Sign in / Sign up

Export Citation Format

Share Document