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 (only showing first 100 items - show all)

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 ⋮ 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

This page was built for publication: