The following pages link to Graph Drawing (Q5711638):
Displaying 19 items.
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints (Q442281) (← links)
- Drawing outerplanar graphs using three edge lengths (Q482350) (← links)
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra (Q652524) (← links)
- On simultaneous straight-line grid embedding of a planar graph and its dual (Q845659) (← links)
- Strictly convex drawings of planar graphs (Q863697) (← links)
- Convex drawings of 3-connected plane graphs (Q879963) (← links)
- Convex drawings of graphs with non-convex boundary constraints (Q947122) (← links)
- An algorithm for constructing star-shaped drawings of plane graphs (Q1037784) (← links)
- Morphing Schnyder drawings of planar triangulations (Q1739203) (← links)
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners (Q2428681) (← links)
- On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs (Q2936956) (← links)
- On self-approaching and increasing-chord drawings of 3-connected planar graphs (Q2970443) (← links)
- Monotone Drawings of 3-Connected Plane Graphs (Q3452836) (← links)
- On the Number of α-Orientations (Q3508567) (← links)
- Convex Drawings of Internally Triconnected Plane Graphs on O(n 2) Grids (Q3652262) (← links)
- (Q4472498) (← links)
- CONVEX GRID DRAWINGS OF FOUR-CONNECTED PLANE GRAPHS (Q5493893) (← links)
- CONVEX DRAWINGS OF PLANE GRAPHS OF MINIMUM OUTER APICES (Q5493897) (← links)
- A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs (Q5961977) (← links)
