On Embedding a Graph in the Grid with the Minimum Number of Bends
From MaRDI portal
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99) Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15)
Recommendations
Cited in
(only showing first 100 items - show all)- Octagonal drawings of plane graphs with prescribed face areas
- Embedding rectilinear graphs in linear time
- Algorithms for plane representations of acyclic digraphs
- Representations of graphs and networks (coding, layouts and embeddings)
- Lower bounds for planar orthogonal drawings of graphs
- Area requirement and symmetry display of planar upward drawings
- Drawing orders using less ink
- Graph layout for applications in compiler construction
- Advances in the theory and practice of graph drawing
- At most single-bend embeddings of cubic graphs
- Single bend wiring on surfaces
- The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
- New results on drawing angle graphs
- Algorithms for area-efficient orthogonal drawing
- A better heuristic for orthogonal graph drawings
- Rectangular grid drawings of plane graphs
- Three-dimensional orthogonal graph drawing algorithms
- Orthogonal layout with optimal face complexity
- The complexity of Snake and undirected NCL variants
- HV-planarity: algorithms and complexity
- Shortest path embeddings of graphs on surfaces
- Bend-optimal orthogonal drawings of triconnected plane graphs
- Bend-minimum orthogonal drawings in quadratic time
- Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity
- Modifying orthogonal drawings for label placement
- Schematization of networks
- Crooked diagrams with few slopes
- Embedding problems for paths with direction constrained edges.
- Towards area requirements for drawing hierarchically planar graphs
- How to draw the minimum cuts of a planar graph
- An efficient parallel algorithm for finding rectangular duals of plane triangular graphs
- Drawing graphs on rectangular grids
- Drawing planar graphs using the canonical ordering
- Embedding-preserving rectangle visibility representations of nonplanar graphs
- Grid straight-line embeddings of trees with a minimum number of bends per path
- Orthogonal planarity testing of bounded treewidth graphs
- Rikudo is NP-complete
- Planar rectilinear drawings of outerplanar graphs in linear time
- Sketched representations and orthogonal planarity of bounded treewidth graphs
- On the area requirements of planar straight-line orthogonal drawings of ternary trees
- On embedding a graph in the grid with the maximum number of bends and other bad features
- On orthogonally convex drawings of plane graphs
- A note on 3D orthogonal drawings with direction constrained edges
- Orthogeodesic point-set embedding of trees
- Bend complexity and Hamiltonian cycles in grid graphs
- Universal slope sets for 1-bend planar drawings
- Schnyder decompositions for regular plane graphs and application to drawing
- An experimental comparison of four graph drawing algorithms.
- Orthogonal drawings of graphs with vertex and edge labels
- The three-phase method: a unified approach to orthogonal graph drawing
- An algorithm for 1-bend embeddings of planar graphs in the two-dimensional grid
- Finding paths in grids with forbidden transitions
- Algorithms for Drawing Planar p-petal Graphs
- Relating bends and size in orthogonal graph drawings
- Vertex contact graphs of paths on a grid
- Orthogonal graph drawing with inflexible edges
- Minimum rectilinear polygons for given angle sequences
- On the density of non-simple 3-planar graphs
- Simultaneous orthogonal planarity
- How to draw a planarization
- Edge intersection graphs of single bend paths on a grid
- Graph compact orthogonal layout algorithm
- Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames
- Overloaded orthogonal drawings
- Hardness of approximate compaction for nonplanar orthogonal graph drawings
- On minimal-node-cost planar embeddings
- Efficient automated schematic map drawing using multiobjective mixed integer programming
- Simultaneous embedding of embedded planar graphs
- NP-completeness for minimizing maximum edge length in grid embeddings
- Rectilinear Graphs and Their Embeddings
- Bend-optimal orthogonal graph drawing in the general position model
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
- The shape of orthogonal cycles in three dimensions
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- Closed, oriented, connected 3-manifolds are subtle equivalence classes of plane graphs
- An O(n log n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT
- Orthogonal graph drawing with flexibility constraints
- scientific article; zbMATH DE number 1858605 (Why is no real title available?)
- Square-orthogonal drawing with few bends per edge
- Crossing Layout in Non-planar Graph Drawings
- Planar L-Drawings of Bimodal Graphs
- An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings
- On Turn-Regular Orthogonal Representations
- Extending Partial Orthogonal Drawings
- Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
- Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
- The Turing Test for Graph Drawing Algorithms
- On turn-regular orthogonal representations
- Planar L-drawings of bimodal graphs
- Optimal orthogonal drawings of triconnected plane graphs
- Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)
- On the complexity of anchored rectangle packing
- Extending partial orthogonal drawings
- Upward planar drawings with two slopes
- Efficient Algorithms for Ortho-Radial Graph Drawing.
- Approximation Algorithms for Facial Cycles in Planar Embeddings
- Computing orthogonal drawings with the minimum number of bends
- Orthogonal drawing of high degree graphs with small area and few bends
- How to draw a planarization
This page was built for publication: On Embedding a Graph in the Grid with the Minimum Number of Bends
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3801098)
