A better heuristic for orthogonal graph drawings

DOI10.1016/S0925-7721(97)00026-6zbMath0894.68104OpenAlexW2117205241WikidataQ56689781 ScholiaQ56689781MaRDI QIDQ1384200

Publication date: 19 August 1998

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(97)00026-6

zbMATH Keywords

orthogonal graph drawings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Orthogonal layout with optimal face complexity, On the minimum corridor connection problem and other generalized geometric problems, Relating bends and size in orthogonal graph drawings, On Turn-Regular Orthogonal Representations, Quasi-upward planar drawings with minimum curve complexity, Orthogeodesic point-set embedding of trees, Graph Compact Orthogonal Layout Algorithm, Computing orthogonal drawings with the minimum number of bends, Algorithms for area-efficient orthogonal drawing, Bend-optimal orthogonal graph drawing in the general position model, Orthogonal Graph Drawing with Inflexible Edges, Universal slope sets for 1-bend planar drawings, Overloaded Orthogonal Drawings, Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario, Rectangular spiral galaxies are still hard, Planar Confluent Orthogonal Drawings of 4-Modal Digraphs, Kernelization for feedback vertex set via elimination distance to a forest, Planar confluent orthogonal drawings of 4-modal digraphs, Unit-length rectangular drawings of graphs, Mario Kart Is Hard, A topology-shape-metrics framework for ortho-radial graph drawing, An annotated review on graph drawing and its applications, 1-Bend Upward Planar Drawings of SP-Digraphs, Simultaneous Orthogonal Planarity, Proper colorability of segment intersection graphs, Visibility representations of toroidal and Klein-bottle graphs, Sliding column model for t-unit bar visibility representations of graphs, Schnyder decompositions for regular plane graphs and application to drawing, Algorithmic aspects of secure domination in unit disk graphs, Drawing trees in a streaming model, 1-bend upward planar slope number of SP-digraphs, Sketched representations and orthogonal planarity of bounded treewidth graphs, Liar's domination in unit disk graphs, Secure connected domination and secure total domination in unit disk graphs and rectangle graphs, Complexity of minimum corridor guarding problems, THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING, Unnamed Item, Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles, Bend-minimum orthogonal drawings in quadratic time, Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity, Orthogonal graph drawing with flexibility constraints, Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles, On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings, Unnamed Item, Orthogonal graph drawing with inflexible edges, Vertex-edge domination in unit disk graphs, Square-Orthogonal Drawing with Few Bends per Edge, The complexity of data aggregation in static and dynamic wireless sensor networks, The DFS-heuristic for orthogonal graph drawing, Balanced vertex-orderings of graphs, Universal slope sets for upward planar drawings, Universal slope sets for upward planar drawings, The Monotone Satisfiability Problem with Bounded Variable Appearances, Capacitated discrete unit disk cover, Non-planar square-orthogonal drawing with few-bend edges, Accelerated Bend Minimization, On the two-dimensional orthogonal drawing of series-parallel graphs, Orthogonal planarity testing of bounded treewidth graphs, Three-dimensional orthogonal graph drawing algorithms, Advances in the theory and practice of graph drawing, Crossing Layout in Non-planar Graph Drawings, An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings, On Turn-Regular Orthogonal Representations, The Turing Test for Graph Drawing Algorithms, DYNAMIC POINT LABELING IS STRONGLY PSPACE-COMPLETE

Cites Work