Distributed graph visualization on tiled displays

2013 ◽  
Author(s):  
Sangwon Chae
Keyword(s):  
Graph Visualization ◽  
Tiled Displays

scholarly journals C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width

Algorithmica ◽  
2021 ◽  
Author(s):  
Giordano Da Lozzo ◽  
David Eppstein ◽  
Michael T. Goodrich ◽  
Siddharth Gupta
Keyword(s):  
Dual Graph ◽  
Graph Visualization ◽  
Closed Disk ◽  
Running Time ◽  
Planar Embedding ◽  
Bounded Treewidth ◽  
Fpt Algorithm ◽  
Vertex Set ◽  
The One ◽  
Clustered Planarity

AbstractFor a clustered graph, i.e, a graph whose vertex set is recursively partitioned into clusters, the C-Planarity Testing problem asks whether it is possible to find a planar embedding of the graph and a representation of each cluster as a region homeomorphic to a closed disk such that (1) the subgraph induced by each cluster is drawn in the interior of the corresponding disk, (2) each edge intersects any disk at most once, and (3) the nesting between clusters is reflected by the representation, i.e., child clusters are properly contained in their parent cluster. The computational complexity of this problem, whose study has been central to the theory of graph visualization since its introduction in 1995 [Feng, Cohen, and Eades, Planarity for clustered graphs, ESA’95], has only been recently settled [Fulek and Tóth, Atomic Embeddability, Clustered Planarity, and Thickenability, to appear at SODA’20]. Before such a breakthrough, the complexity question was still unsolved even when the graph has a prescribed planar embedding, i.e, for embedded clustered graphs. We show that the C-Planarity Testing problem admits a single-exponential single-parameter FPT (resp., XP) algorithm for embedded flat (resp., non-flat) clustered graphs, when parameterized by the carving-width of the dual graph of the input. These are the first FPT and XP algorithms for this long-standing open problem with respect to a single notable graph-width parameter. Moreover, the polynomial dependency of our FPT algorithm is smaller than the one of the algorithm by Fulek and Tóth. In particular, our algorithm runs in quadratic time for flat instances of bounded treewidth and bounded face size. To further strengthen the relevance of this result, we show that an algorithm with running time O(r(n)) for flat instances whose underlying graph has pathwidth 1 would result in an algorithm with running time O(r(n)) for flat instances and with running time $$O(r(n^2) + n^2)$$ O ( r ( n 2 ) + n 2 ) for general, possibly non-flat, instances.

scholarly journals VisualGraphX: interactive graph visualization within Galaxy

2016 ◽  
pp. btw414
Author(s):  
Richard A. Schäfer ◽  
Björn Voß
Keyword(s):  
Graph Visualization

Spatially uniform colors for projectors and tiled displays

2007 ◽  
Vol 15 (9) ◽  
pp. 679 ◽  
Author(s):  
Alain Pagani ◽  
Didier Stricker
Keyword(s):  
Tiled Displays

The program of the advanced training course for teachers of mathematics and informatics "Graphs and graph models: methods of visual processing "

2021 ◽  
pp. 31-41
Author(s):  
N. V. Klimina ◽  
I. А. Morozov
Keyword(s):  
Extracurricular Activities ◽  
Information Visualization ◽  
Visual Processing ◽  
New Technologies ◽  
Visual Presentation ◽  
Gifted Children ◽  
Advanced Training ◽  
Graph Visualization ◽  
Training Course ◽  
Educational Information

The method of visual presentation of educational information for solving problems of mathematics and informatics is effective for the development of algorithmic, logical and computational thinking of schoolchildren. Technical progress, informatization of education, the emergence of modern software for visualization of information change the activities of teachers who need to master new technologies of information visualization for use in the classroom and in work with gifted children. Visual models for presenting educational information and methods of their processing with the use of computer programs are also relevant in extracurricular activities, allowing to develop the intellectual abilities of schoolchildren. Teachers are required to teach children to create projects in which visibility is a necessary component and must be represented by an electronic product created using modern information visualization tools. The article proposes a variant of the advanced training course for teachers of mathematics and informatics on teaching methods for visualization of solving problems using graphs and the free software “Graphoanalyzator”. The relevance of the course is due to the need to form the competency to carry out targeted work with gifted children in the use of software for creating and processing graphs based on the graph visualization program “Graphoanalyzator”. The authors believe that the training of teachers on this course will contribute to the formation of their skills to solve problems of mathematical modeling in informatics and mathematics, to apply information technologies to solve pedagogical problems in the context of informatization of education. 

Sign in / Sign up

Export Citation Format

Share Document