## 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 (Electronic) | 9789812773296 |

ISBN (Print) | 9812568441, 9789812568441 |

DOIs | |

State | Published - Jan 1 2006 |

## ASJC Scopus subject areas

- General Computer Science