Pages that link to "Item:Q1386370"
From MaRDI portal
The following pages link to An algorithm for straight-line drawing of planar graphs (Q1386370):
Displaying 24 items.
- Drawing plane graphs nicely (Q797289) (← links)
- Area-efficient planar straight-line drawings of outerplanar graphs (Q885284) (← links)
- An algorithm for constructing star-shaped drawings of plane graphs (Q1037784) (← links)
- Graph layout for applications in compiler construction (Q1285776) (← links)
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs (Q1702255) (← links)
- An algorithm for drawing general undirected graphs (Q1822997) (← links)
- Planar polyline drawings via graph transformations (Q2379928) (← links)
- Orthogonal drawings based on the stratification of planar graphs (Q2816061) (← links)
- Trade-Offs in Planar Polyline Drawings (Q2936936) (← links)
- Performing Multicut on Walkable Environments (Q2958325) (← links)
- Bitonic st-orderings for Upward Planar Graphs (Q2961518) (← links)
- Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time (Q2961525) (← links)
- Rook-drawings of Plane Graphs (Q2971388) (← links)
- Drawing Graphs on Two and Three Lines (Q3378491) (← links)
- Straight-Line Drawability of a Planar Graph Plus an Edge (Q3449828) (← links)
- On Rectilinear Drawing of Graphs (Q3557881) (← links)
- Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints (Q3611859) (← links)
- (Q4431088) (← links)
- (Q4862220) (← links)
- Compact drawings of 1-planar graphs with right-angle crossings and few bends (Q5915941) (← links)
- Drawing graphs as spanners (Q5918794) (← links)
- Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario (Q6053469) (← links)
- Transcript design problem of oritatami systems (Q6151174) (← links)
- Programmable single-stranded architectures for computing (Q6535757) (← links)
