scientific article

Roberto Tamassia, Peter Eades, Giuseppe Di Battista, Ioannis. G. Tollis

Publication date: 16 December 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

human-computer interaction graph algorithms computational geometry graph drawing information visualization

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Upward Planar Drawings with Three and More Slopes ⋮ On Turn-Regular Orthogonal Representations ⋮ Scalable Visual Analytics in FCA ⋮ On Edge-Length Ratios of Partial 2-Trees ⋮ Recognizing IC-Planar and NIC-Planar Graphs ⋮ Upward planar drawings with two slopes ⋮ Straight-line drawings of 1-planar graphs ⋮ Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time ⋮ k-Planar Placement and Packing of Δ-Regular Caterpillars ⋮ Upward book embeddability of $st$-graphs: complexity and algorithms ⋮ Mutual witness Gabriel drawings of complete bipartite graphs ⋮ Mutual witness Gabriel drawings of complete bipartite graphs ⋮ Unit-length rectangular drawings of graphs ⋮ Strictly-convex drawings of 3-connected planar graphs ⋮ Rectilinear planarity of partial 2-trees ⋮ Computing a feedback arc set using PageRank ⋮ $st$-orientations with few transitive edges ⋮ $st$-Orientations with Few Transitive Edges ⋮ Rectilinear Planarity of Partial 2-Trees ⋮ A topology-shape-metrics framework for ortho-radial graph drawing ⋮ An annotated review on graph drawing and its applications ⋮ Dominance drawings for DAGs with bounded modular width ⋮ Parameterized approaches to orthogonal compaction ⋮ On the 2-layer window width minimization problem ⋮ Effective Computation of a Feedback Arc Set Using PageRank ⋮ Neural Representation of Spatial Topology in the Rodent Hippocampus ⋮ An Experimental Study on the Ply Number of Straight-line Drawings ⋮ 3D Visibility Representations of 1-planar Graphs ⋮ MLSEB: Edge Bundling Using Moving Least Squares Approximation ⋮ A New Approach to Exact Crossing Minimization ⋮ Computing Upward Topological Book Embeddings of Upward Planar Digraphs ⋮ Constrained Simultaneous and Near-Simultaneous Embeddings ⋮ Two Results on Layered Pathwidth and Linear Layouts ⋮ Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area ⋮ Data Structures and their Planar Graph Layouts ⋮ -shaped point set embeddings of high-degree plane graphs ⋮ PATHWIDTH AND LAYERED DRAWINGS OF TREES ⋮ On the complexity of orthogonal compaction ⋮ Drawing planar graphs with circular arcs ⋮ A multi-scale algorithm for drawing graphs nicely ⋮ Universal slope sets for upward planar drawings ⋮ Upward planar morphs ⋮ Greedy rectilinear drawings ⋮ Ortho-polygon visibility representations of 3-connected 1-plane graphs ⋮ Incremental bipartite drawing problem ⋮ Matched Drawability of Graph Pairs and of Graph Triples ⋮ An Improved Upward Planarity Testing Algorithm and Related Applications ⋮ The drawability problem for minimum weight triangulations ⋮ Upward planar morphs ⋮ Inserting an edge into a geometric embedding ⋮ Parameterized complexity of graph planarity with restricted cyclic orders ⋮ Queue layouts of planar 3-trees ⋮ Rectangular drawings of plane graphs without designated corners ⋮ Greedy rectilinear drawings ⋮ A graph drawing algorithm for visualizing multivariate categorical data ⋮ Visual Analysis of One-to-Many Matched Graphs ⋮ The Binary Stress Model for Graph Drawing ⋮ Embeddability Problems for Upward Planar Digraphs ⋮ A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs ⋮ Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints ⋮ Dunnart: A Constraint-Based Network Diagram Authoring Tool ⋮ A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs ⋮ Approximation algorithms for minimizing edge crossings in radial drawings ⋮ Polynomial Area Bounds for MST Embeddings of Trees ⋮ Line Crossing Minimization on Metro Maps ⋮ LunarVis – Analytic Visualizations of Large Graphs ⋮ Crossing numbers of beyond-planar graphs ⋮ Drawing Planar Graphs with Reduced Height ⋮ Crossing numbers of beyond-planar graphs ⋮ How to morph a tree on a small grid ⋮ Triangulations with Circular Arcs ⋮ On the upward book thickness problem: combinatorial and complexity results ⋮ Unnamed Item ⋮ Drawing Graphs on Few Circles and Few Spheres ⋮ On the upward book thickness problem: combinatorial and complexity results ⋮ Accelerated Bend Minimization ⋮ INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS ⋮ Evolutionary graph drawing algorithms ⋮ Upward Book Embeddings of st-Graphs ⋮ Bipartite Graph Representation of Multiple Decision Table Classifiers ⋮ Unnamed Item ⋮ A New Framework for Hierarchical Drawings ⋮ Unnamed Item ⋮ TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY ⋮ Multilevel Planarity ⋮ Beyond Planar Graphs: Introduction ⋮ Quasi-planar Graphs ⋮ Algorithms for 1-Planar Graphs ⋮ Fan-Planar Graphs ⋮ Improved Upper and Lower Bounds for LR Drawings of Binary Trees ⋮ On the Edge-Length Ratio of 2-Trees ⋮ On Turn-Regular Orthogonal Representations ⋮ Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time ⋮ New Quality Metrics for Dynamic Graph Drawing ⋮ The Turing Test for Graph Drawing Algorithms ⋮ Straight-line monotone grid drawings of series–parallel graphs ⋮ Applying data visualization techniques for stock relationship analysis ⋮ Complex systems: features, similarity and connectivity ⋮ Dimension reduction in principal component analysis for trees ⋮ Outer 1-planar graphs ⋮ Recognizing and drawing IC-planar graphs ⋮ Ranking chain sum orders ⋮ On triconnected and cubic plane graphs on given point sets ⋮ A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs ⋮ HV-planarity: algorithms and complexity ⋮ Triangulations without minimum-weight drawing ⋮ On the approximability of two tree drawing conventions ⋮ On multi-objective optimization aided drawing of special graphs ⋮ Simultaneous visibility representations of plane $st$-graphs using L-shapes ⋮ Improved algorithm for the symmetry number problem on trees ⋮ The approximability of three-dimensional assignment problems with bottleneck objective ⋮ The strength of weak proximity ⋮ On simultaneous planar graph embeddings ⋮ Tabu search for the dynamic bipartite drawing problem ⋮ Witness Gabriel graphs ⋮ Algorithms for multi-level graph planarity testing and layout ⋮ Drawing polytopal graphs with {\texttt{polymake}} ⋮ 1-page and 2-page drawings with bounded number of crossings per edge ⋮ Topological morphing of planar graphs ⋮ Area-efficient planar straight-line drawings of outerplanar graphs ⋮ Drawing $c$-planar biconnected clustered graphs ⋮ Upward planar drawings on the standing and the rolling cylinders ⋮ Pushing blocks is hard. ⋮ Tutte's barycenter method applied to isotopies ⋮ Complexity analysis of balloon drawing for rooted trees ⋮ Improved floor-planning of graphs via adjacency-preserving transformations ⋮ The shape of orthogonal cycles in three dimensions ⋮ Crossing-number critical graphs have bounded path-width ⋮ Good spanning trees in graph drawing ⋮ Drawing a tree as a minimum spanning tree approximation ⋮ Variable neighborhood scatter search for the incremental graph drawing problem ⋮ Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph ⋮ Straight-line rectangular drawings of clustered graphs ⋮ L-visibility drawings of IC-planar graphs ⋮ Fast layout computation of clustered networks: algorithmic advances and experimental analysis ⋮ Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs ⋮ $\mathsf{T}$-shape visibility representations of 1-planar graphs ⋮ On triangle cover contact graphs ⋮ Orthogonal drawings and crossing numbers of the Kronecker product of two cycles ⋮ Realizability of graphs as triangle cover contact graphs ⋮ Drawing trees in a streaming model ⋮ Expansion of layouts of complete binary trees into grids ⋮ Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints ⋮ Planar crossing numbers of graphs of bounded genus ⋮ Straight-line drawings of outerplanar graphs in $O(dn \log n)$ area ⋮ Vertex angle and crossing angle resolution of leveled tree drawings ⋮ Point-set embeddings of trees with given partial drawings ⋮ Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra ⋮ A regularized graph layout framework for dynamic network visualization ⋮ Image-based graph visualization: advances and challenges ⋮ A heuristic approach towards drawings of graphs with high crossing resolution ⋮ Bend-minimum orthogonal drawings in quadratic time ⋮ Algorithms and bounds for drawing directed graphs ⋮ Topological additive numbering of directed acyclic graphs ⋮ Fixed parameter algorithms for one-sided crossing minimization revisited ⋮ Modifying orthogonal drawings for label placement ⋮ Track layouts, layered path decompositions, and leveled planarity ⋮ On the edge-length ratio of outerplanar graphs ⋮ On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings ⋮ Maximum upward planar subgraphs of embedded planar digraphs ⋮ Radial drawings of graphs: geometric constraints and trade-offs ⋮ Complexity results for three-dimensional orthogonal graph drawing ⋮ On the parameterized complexity of layered graph drawing ⋮ Drawing colored graphs on colored points ⋮ Algorithms for computing a parameterized $st$-orientation ⋮ Complexity dichotomy on partial grid recognition ⋮ A celtic framework for knots and links ⋮ Boundary labeling with octilinear leaders ⋮ Drawing colored graphs with constrained vertex positions and few bends per edge ⋮ On the one-sided crossing minimization in a bipartite graph with large degrees ⋮ Curve-constrained drawings of planar graphs ⋮ Grid drawings of $k$-colourable graphs ⋮ Planar minimally rigid graphs and pseudo-triangulations ⋮ Matched drawability of graph pairs and of graph triples ⋮ Schematization of networks ⋮ Drawing graphs with right angle crossings ⋮ Comparing trees via crossing minimization ⋮ Improving the running time of embedded upward planarity testing ⋮ Planar bus graphs ⋮ The partial visibility representation extension problem ⋮ Ortho-polygon visibility representations of embedded graphs ⋮ Drawing slicing graphs with face areas ⋮ Witness rectangle graphs ⋮ Open problems on graph eigenvalues studied with AutoGraphiX ⋮ On the complexity of crossings in permutations ⋮ On embedding a cycle in a plane graph ⋮ A graph-theoretic perspective on the links-to-concepts ratio expected in cognitive maps ⋮ Open rectangle-of-influence drawings of inner triangulated plane graphs ⋮ Small area drawings of outerplanar graphs ⋮ Planar straight-line point-set embedding of trees with partial embeddings ⋮ An algorithm for constructing star-shaped drawings of plane graphs ⋮ How to draw a clustered tree ⋮ New bounds on the barycenter heuristic for bipartite graph drawing. ⋮ Embedding problems for paths with direction constrained edges. ⋮ The symmetry number problem for trees ⋮ A force-directed algorithm that preserves edge-crossing properties ⋮ Drawing graphs by eigenvectors: theory and practice ⋮ Optimal three-dimensional orthogonal graph drawing in the general position model. ⋮ Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges ⋮ Approximation algorithms for aligning points ⋮ Proximity drawings in polynomial area and volume ⋮ A multi-dimensional approach to force-directed layouts of large graphs ⋮ Tree-decompositions with bags of small diameter ⋮ A new algorithm for removing node overlapping in graph visualization ⋮ Straight-Line Drawability of a Planar Graph Plus an Edge ⋮ Computing maximum upward planar subgraphs of single-source embedded digraphs ⋮ Algorithms and Bounds for L-Drawings of Directed Graphs ⋮ An extension of the Lindström-Gessel-Viennot theorem ⋮ Drawing Graphs with Right Angle Crossings ⋮ From Tutte to Floater and Gotsman: on the resolution of planar straight-line drawings and morphs ⋮ Upward planar drawings with three and more slopes ⋮ Planar straight-line realizations of 2-trees with prescribed edge lengths ⋮ Quasi-upward planar drawings with minimum curve complexity ⋮ Optimal-area visibility representations of outer-1-plane graphs ⋮ Combinatorial Vector Field Topology in Three Dimensions ⋮ Computing straight-line 3D grid drawings of graphs in linear volume ⋮ A note on 3D orthogonal drawings with direction constrained edges ⋮ Algorithms for solving the symmetry number problem on trees ⋮ Unnamed Item ⋮ On RAC drawings of 1-planar graphs ⋮ Finding all minimum cost flows and a faster algorithm for the $K$ best flow problem ⋮ An annotated bibliography on 1-planarity ⋮ Skyscraper polytopes and realizations of plane triangulations ⋮ $\mathsf{NIC}$-planar graphs ⋮ Universal slope sets for 1-bend planar drawings ⋮ Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames ⋮ On Point-Sets That Support Planar Graphs ⋮ Overloaded Orthogonal Drawings ⋮ Force-Directed Lombardi-Style Graph Drawing ⋮ Monotone Drawings of Graphs with Fixed Embedding ⋮ Classification of Planar Upward Embedding ⋮ Tree drawings revisited ⋮ A GENERAL APPROXIMATION ALGORITHM FOR PLANAR MAPS WITH APPLICATIONS ⋮ On embedding triconnected cubic graphs on point sets ⋮ Algorithms for visualizing phylogenetic networks ⋮ Realizability of Graphs as Triangle Cover Contact Graphs ⋮ Hanani-Tutte for radial planarity. II ⋮ 1-Bend Upward Planar Drawings of SP-Digraphs ⋮ On the Density of Non-simple 3-Planar Graphs ⋮ Hanani-Tutte for Radial Planarity II ⋮ A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners ⋮ Algorithms for the multiple label placement problem ⋮ Colored anchored visibility representations in 2D and 3D space ⋮ 1-bend upward planar slope number of SP-digraphs ⋮ On the edge-length ratio of planar graphs ⋮ On arrangements of orthogonal circles ⋮ Sketched representations and orthogonal planarity of bounded treewidth graphs ⋮ Parameterized complexity of graph planarity with restricted cyclic orders ⋮ Drawing partial 2-trees with few slopes ⋮ From simulated annealing to stochastic continuation: a new trend in combinatorial optimization ⋮ An Experimental Study on the Ply Number of Straight-Line Drawings ⋮ On the area requirements of planar straight-line orthogonal drawings of ternary trees ⋮ Drawing a rooted tree as a rooted $y$-monotone minimum spanning tree ⋮ Discrete trace theorems and energy minimizing spring embeddings of planar graphs ⋮ Approximating the fixed linear crossing number ⋮ Grid drawings of graphs with constant edge-vertex resolution ⋮ Crossing-constrained hierarchical drawings ⋮ Upward point set embeddings of paths and trees ⋮ Re-embedding a 1-plane graph for a straight-line drawing in linear time ⋮ Data-driven graph drawing techniques with applications for conveyor systems ⋮ A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs ⋮ A framework and algorithms for circular drawings of graphs ⋮ Embedding-preserving rectangle visibility representations of nonplanar graphs ⋮ On the number of upward planar orientations of maximal planar graphs ⋮ Computing upward topological book embeddings of upward planar digraphs ⋮ Maximum weighted matching with few edge crossings for 2-layered bipartite graph ⋮ Drawing cubic graphs with at most five slopes ⋮ Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization ⋮ LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs ⋮ A better heuristic for area-compaction of orthogonal representations ⋮ Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm ⋮ An analysis of some linear graph layout heuristics ⋮ NP-completeness of st-orientations for plane graphs ⋮ On embedding a graph in the grid with the maximum number of bends and other bad features ⋮ Automatic layout of statecharts ⋮ Upward three-dimensional grid drawings of graphs ⋮ Simultaneous FPQ-ordering and hybrid planarity testing ⋮ Upward planar graphs and their duals ⋮ The Straight-Line RAC Drawing Problem Is NP-Hard ⋮ Simultaneous Visibility Representations of Plane st-graphs Using L-shapes ⋮ On 3D visibility representations of graphs with few crossings per edge ⋮ Orthogonal planarity testing of bounded treewidth graphs ⋮ NodeTrix planarity testing with small clusters ⋮ Planar drawings of fixed-mobile bigraphs ⋮ A simulated annealing algorithm for determining the thickness of a graph ⋮ Planarity of streamed graphs ⋮ Orthogonal drawings of graphs with vertex and edge labels ⋮ One-dimensional layout optimization, with applications to graph drawing by axis separation ⋮ Tabu search for min-max edge crossing in graphs ⋮ Incremental convex planarity testing ⋮ Computers and discovery in algebraic graph theory ⋮ Random Generation of Directed Acyclic Graphs ⋮ Geometric Thickness in a Grid of Linear Area ⋮ Monotone drawings of graphs with fixed embedding ⋮ Sum of edge lengths of a multigraph drawn on a convex polygon ⋮ Voronoi drawings of trees ⋮ Force-directed layout of order diagrams using dimensional reduction