Spirality and Optimal Orthogonal Drawings
From MaRDI portal
Publication:4210131
DOI10.1137/S0097539794262847zbMath0910.05061OpenAlexW2083597100MaRDI QIDQ4210131
Francesco Vargiu, Giuseppe Liotta, Giuseppe Di Battista
Publication date: 21 September 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539794262847
planar graphspolynomial algorithmsgraph drawingseries-parallel graphsplanar embeddingorthogonal drawingorthogonal representationbend minimizationspirality
Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (30)
On orthogonally convex drawings of plane graphs ⋮ Planar rectilinear drawings of outerplanar graphs in linear time ⋮ HV-planarity: algorithms and complexity ⋮ Extending Partial Orthogonal Drawings ⋮ Planar Embeddings with Small and Uniform Faces ⋮ Orthogonal Graph Drawing with Inflexible Edges ⋮ Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time ⋮ Unit-length rectangular drawings of graphs ⋮ Rectilinear planarity of partial 2-trees ⋮ Testing upward planarity of partial 2-trees ⋮ Rectilinear Planarity of Partial 2-Trees ⋮ An annotated review on graph drawing and its applications ⋮ Sliding column model for t-unit bar visibility representations of graphs ⋮ Optimal morphs of planar orthogonal drawings. II ⋮ Sketched representations and orthogonal planarity of bounded treewidth graphs ⋮ Parameterized complexity of graph planarity with restricted cyclic orders ⋮ Bend-optimal orthogonal drawings of triconnected plane graphs ⋮ Unnamed Item ⋮ Bend-minimum orthogonal drawings in quadratic time ⋮ Orthogonal graph drawing with flexibility constraints ⋮ Orthogonal graph drawing with inflexible edges ⋮ On embedding a graph in the grid with the maximum number of bends and other bad features ⋮ Unnamed Item ⋮ Grid straight-line embeddings of trees with a minimum number of bends per path ⋮ On the two-dimensional orthogonal drawing of series-parallel graphs ⋮ Algorithms for Drawing Planar p-petal Graphs ⋮ Orthogonal planarity testing of bounded treewidth graphs ⋮ Extending Partial Orthogonal Drawings ⋮ Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time ⋮ Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
This page was built for publication: Spirality and Optimal Orthogonal Drawings
