Pages that link to "Item:Q3801098"
From MaRDI portal
The following pages link to On Embedding a Graph in the Grid with the Minimum Number of Bends (Q3801098):
Displaying 50 items.
- Relating bends and size in orthogonal graph drawings (Q293201) (← links)
- Efficient automated schematic map drawing using multiobjective mixed integer programming (Q337580) (← links)
- Bend-optimal orthogonal graph drawing in the general position model (Q390165) (← links)
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system (Q391976) (← links)
- The shape of orthogonal cycles in three dimensions (Q411405) (← links)
- Orthogonal graph drawing with flexibility constraints (Q476441) (← links)
- Strip planarity testing for embedded planar graphs (Q524364) (← links)
- Orthogonal graph drawing with inflexible edges (Q679739) (← links)
- Ortho-polygon visibility representations of embedded graphs (Q724238) (← links)
- Non-planar square-orthogonal drawing with few-bend edges (Q744098) (← links)
- Minimum rectilinear polygons for given angle sequences (Q824339) (← links)
- Finding a minimum medial axis of a discrete shape is NP-hard (Q952462) (← links)
- Complexity results for three-dimensional orthogonal graph drawing (Q954967) (← links)
- Upward drawings of triconnected digraphs. (Q960528) (← links)
- PSPACE-completeness of an escape problem (Q975459) (← links)
- Octagonal drawings of plane graphs with prescribed face areas (Q1000923) (← links)
- Embedding rectilinear graphs in linear time (Q1111399) (← links)
- Algorithms for plane representations of acyclic digraphs (Q1124349) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Lower bounds for planar orthogonal drawings of graphs (Q1182115) (← links)
- Area requirement and symmetry display of planar upward drawings (Q1189288) (← links)
- Drawing orders using less ink (Q1205151) (← links)
- Graph layout for applications in compiler construction (Q1285776) (← links)
- Advances in the theory and practice of graph drawing (Q1285778) (← links)
- Single bend wiring on surfaces (Q1348375) (← links)
- The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings (Q1350939) (← links)
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid (Q1382254) (← links)
- New results on drawing angle graphs (Q1384188) (← links)
- Algorithms for area-efficient orthogonal drawing (Q1384191) (← links)
- A better heuristic for orthogonal graph drawings (Q1384200) (← links)
- Rectangular grid drawings of plane graphs (Q1392851) (← links)
- Three-dimensional orthogonal graph drawing algorithms (Q1570822) (← links)
- Orthogonal layout with optimal face complexity (Q1616241) (← links)
- The complexity of Snake and undirected NCL variants (Q1623271) (← links)
- HV-planarity: algorithms and complexity (Q1628786) (← links)
- Shortest path embeddings of graphs on surfaces (Q1688859) (← links)
- Bend-optimal orthogonal drawings of triconnected plane graphs (Q1713568) (← links)
- Bend-minimum orthogonal drawings in quadratic time (Q1725783) (← links)
- Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity (Q1725786) (← links)
- Modifying orthogonal drawings for label placement (Q1736777) (← links)
- On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings (Q1741861) (← links)
- An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791) (← links)
- Schematization of networks (Q1776896) (← links)
- Crooked diagrams with few slopes (Q1814184) (← links)
- Embedding problems for paths with direction constrained edges. (Q1853570) (← links)
- Towards area requirements for drawing hierarchically planar graphs (Q1870562) (← links)
- How to draw the minimum cuts of a planar graph (Q1882854) (← links)
- An efficient parallel algorithm for finding rectangular duals of plane triangular graphs (Q1892581) (← links)
- Drawing planar graphs using the canonical ordering (Q1920418) (← links)
- Embedding-preserving rectangle visibility representations of nonplanar graphs (Q1991089) (← links)
