Spirality and Optimal Orthogonal Drawings
DOI10.1137/S0097539794262847zbMATH Open0910.05061OpenAlexW2083597100MaRDI QIDQ4210131FDOQ4210131
Authors: Giuseppe Di Battista, Giuseppe Liotta, Francesco Vargiu 
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
Recommendations
- Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)
- Algorithms and Computation
- Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
- scientific article; zbMATH DE number 1953108
- On bend-minimized orthogonal drawings of planar 3-graphs
planar graphsgraph drawingpolynomial algorithmsseries-parallel graphsorthogonal drawingorthogonal representationbend minimizationplanar embeddingspirality
Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Cited In (40)
- Algorithms for Drawing Planar p-petal Graphs
- Bend-minimum orthogonal drawings in quadratic time
- Orthogonal planarity testing of bounded treewidth graphs
- Rectilinear Planarity of Partial 2-Trees
- An annotated review on graph drawing and its applications
- Title not available (Why is that?)
- Linear-time rectilinear drawings of subdivisions of triconnected cubic planar graphs with orthogonally convex faces
- HV-planarity: algorithms and complexity
- Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
- Drawing Borders Efficiently
- Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
- Orthogonal graph drawing with flexibility constraints
- Sliding column model for t-unit bar visibility representations of graphs
- Orthogonal graph drawing with inflexible edges
- Orthogonal graph drawing with inflexible edges
- Extending partial orthogonal drawings
- Unit-length rectangular drawings of graphs
- On the parameterized complexity of bend-minimum orthogonal planarity
- Upward and orthogonal planarity are W[1]-hard parameterized by treewidth
- Drawing borders efficiently
- On orthogonally convex drawings of plane graphs
- Title not available (Why is that?)
- Planar embeddings with small and uniform faces
- On the parameterized complexity of bend-minimum orthogonal planarity
- Grid straight-line embeddings of trees with a minimum number of bends per path
- Unit-length rectangular drawings of graphs
- On embedding a graph in the grid with the maximum number of bends and other bad features
- Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time
- On the two-dimensional orthogonal drawing of series-parallel graphs
- Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)
- Planar rectilinear drawings of outerplanar graphs in linear time
- Extending Partial Orthogonal Drawings
- Sketched representations and orthogonal planarity of bounded treewidth graphs
- Optimal morphs of planar orthogonal drawings
- Rectilinear planarity of partial 2-trees
- Testing upward planarity of partial 2-trees
- Orthogonal drawings of graphs for the automation of VLSI circuit design
- Parameterized complexity of graph planarity with restricted cyclic orders
- Bend-optimal orthogonal drawings of triconnected plane graphs
- Optimal morphs of planar orthogonal drawings. II
This page was built for publication: Spirality and Optimal Orthogonal Drawings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210131)
