Extending Partial Orthogonal Drawings
From MaRDI portal
Cites work
- A Kuratowski-type theorem for planarity of partially embedded graphs
- Contact representations of planar graphs: extending a partial representation is hard
- Drawing partially embedded and simultaneously planar graphs
- Embedding planar graphs at fixed vertex locations
- Extending partial representations of circle graphs
- Extending partial representations of subclasses of chordal graphs
- Extending partial representations of trapezoid graphs
- Graph-Theoretic Solutions to Computational Geometry Problems
- ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- On the computational complexity of upward and rectilinear planarity testing
- Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
- Optimal binary space partitions for segments in the plane
- Optimal orthogonal graph drawing with convex bend costs
- Orthogonal graph drawing with inflexible edges
- Simultaneous orthogonal planarity
- Spirality and Optimal Orthogonal Drawings
- Testing Planarity of Partially Embedded Graphs
- The Problem of Compatible Representatives
Cited in
(8)- An annotated review on graph drawing and its applications
- A new algorithm for embedding plane graphs at fixed vertex locations
- Extending partial orthogonal drawings
- Crossing-optimal extension of simple drawings
- Graph Drawing
- Inserting one edge into a simple drawing is hard
- On k-plane insertion into plane drawings
- The parameterized complexity of extending stack layouts
This page was built for publication: Extending Partial Orthogonal Drawings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014122)
