New results on drawing angle graphs
From MaRDI portal
Publication:1384188
DOI10.1016/S0925-7721(97)00016-3zbMath0894.68101MaRDI QIDQ1384188
Publication date: 13 April 1998
Published in: Computational Geometry (Search for Journal in Brave)
Related Items (4)
Polygons with Prescribed Angles in 2D and 3D ⋮ The shape of orthogonal cycles in three dimensions ⋮ Embedding problems for paths with direction constrained edges. ⋮ Polygons with Prescribed Angles in 2D and 3D
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear-time algorithm for drawing a planar graph on a grid
- A framework for solving VLSI graph layout problems
- How to draw a planar graph on a grid
- A unified approach to visibility representations of planar graphs
- Area requirement and symmetry display of planar upward drawings
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Algorithms for drawing graphs: An annotated bibliography
- Drawing planar graphs using the canonical ordering
- Efficient orthogonal drawings of high degree graphs
- An experimental comparison of four graph drawing algorithms.
- Drawing Graphs in the Plane with High Resolution
- On minimal-node-cost planar embeddings
- Rectilinear Graphs and Their Embeddings
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Universality considerations in VLSI circuits
- Efficient Planarity Testing
- On the Angular Resolution of Planar Graphs
- HOW TO DRAW A SERIES-PARALLEL DIGRAPH
- Angles of planar triangular graphs
This page was built for publication: New results on drawing angle graphs
