Abstract
We present a novel way to draw planar graphs with good angular resolution. We introduce the polar coordinate representation and describe a family of algorithms for constructing it. The main advantage of the polar representation is that it allows independent control over grid size and bend positions. We first describe a standard (Cartesian) representation algorithm, CRA, which we then modify to obtain a polar representation algorithm, PRA. In both algorithms we are concerned with the following drawing criteria: angular resolution, bends per edge, vertex resolution, bend-point resolution, edge separation, and drawing area. The CRA algorithm achieves 1 bend per edge, unit vertex and bend resolution, (formula presented) edge separation, (formula presented) drawing area and (formula presented) angular resolution, where d(v) is the degree of vertex v. The PRA algorithm has an improved angular resolution of (formula presented), 1 bend per edge, and unit vertex resolution. For the PRA algorithm, the bend-point resolution and edge separation are parameters that can be modified to achieve different types of drawings and drawing areas. In particular, for the same parameters as the CRA algorithm (unit bend-point resolution and (formula presented) edge separation), the PRA algorithm creates a drawing of size (formula presented).
| Original language | English (US) |
|---|---|
| Title of host publication | Graph Algorithms and Applications 4 |
| Publisher | World Scientific Publishing Co. |
| Pages | 311-334 |
| Number of pages | 24 |
| ISBN (Print) | 9789812773296, 9812568441, 9789812568441 |
| DOIs | |
| State | Published - Jan 1 2006 |
ASJC Scopus subject areas
- Computer Science(all)
Cite this
Polar coordinate drawing of planar graphs with good angular resolution. / Duncan, Christian A.; Kobourov, Stephen G.
Graph Algorithms and Applications 4. World Scientific Publishing Co., 2006. p. 311-334.Research output: Chapter in Book/Report/Conference proceeding › Chapter
}
TY - CHAP
T1 - Polar coordinate drawing of planar graphs with good angular resolution
AU - Duncan, Christian A.
AU - Kobourov, Stephen G
PY - 2006/1/1
Y1 - 2006/1/1
N2 - We present a novel way to draw planar graphs with good angular resolution. We introduce the polar coordinate representation and describe a family of algorithms for constructing it. The main advantage of the polar representation is that it allows independent control over grid size and bend positions. We first describe a standard (Cartesian) representation algorithm, CRA, which we then modify to obtain a polar representation algorithm, PRA. In both algorithms we are concerned with the following drawing criteria: angular resolution, bends per edge, vertex resolution, bend-point resolution, edge separation, and drawing area. The CRA algorithm achieves 1 bend per edge, unit vertex and bend resolution, (formula presented) edge separation, (formula presented) drawing area and (formula presented) angular resolution, where d(v) is the degree of vertex v. The PRA algorithm has an improved angular resolution of (formula presented), 1 bend per edge, and unit vertex resolution. For the PRA algorithm, the bend-point resolution and edge separation are parameters that can be modified to achieve different types of drawings and drawing areas. In particular, for the same parameters as the CRA algorithm (unit bend-point resolution and (formula presented) edge separation), the PRA algorithm creates a drawing of size (formula presented).
AB - We present a novel way to draw planar graphs with good angular resolution. We introduce the polar coordinate representation and describe a family of algorithms for constructing it. The main advantage of the polar representation is that it allows independent control over grid size and bend positions. We first describe a standard (Cartesian) representation algorithm, CRA, which we then modify to obtain a polar representation algorithm, PRA. In both algorithms we are concerned with the following drawing criteria: angular resolution, bends per edge, vertex resolution, bend-point resolution, edge separation, and drawing area. The CRA algorithm achieves 1 bend per edge, unit vertex and bend resolution, (formula presented) edge separation, (formula presented) drawing area and (formula presented) angular resolution, where d(v) is the degree of vertex v. The PRA algorithm has an improved angular resolution of (formula presented), 1 bend per edge, and unit vertex resolution. For the PRA algorithm, the bend-point resolution and edge separation are parameters that can be modified to achieve different types of drawings and drawing areas. In particular, for the same parameters as the CRA algorithm (unit bend-point resolution and (formula presented) edge separation), the PRA algorithm creates a drawing of size (formula presented).
UR - http://www.scopus.com/inward/record.url?scp=84969667984&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84969667984&partnerID=8YFLogxK
U2 - 10.1142/9789812773296_0015
DO - 10.1142/9789812773296_0015
M3 - Chapter
AN - SCOPUS:84969667984
SN - 9789812773296
SN - 9812568441
SN - 9789812568441
SP - 311
EP - 334
BT - Graph Algorithms and Applications 4
PB - World Scientific Publishing Co.
ER -