### Abstract

The most effective drawing techniques are based on force-directed layouts, where modes are viewed as particles subject to various forces, typically involving attractive forces along edges and repulsive forces between nodes. The system is then solved numerically by finding a configuration that locally minimizes the energy or the forces. Once the nodes have been positions, edges can be draw as line segments. The graph drawing is animated as a three-step process. First, force-directed placement to position the nodes as points is used. The Voronoi-based technique to reposition the nodes to avoid node overlaps is then employed. Finally, the graph edges as splines, connecting two nodes while avoiding intervening nodes is routed.

Original language | English (US) |
---|---|

Pages | 425-426 |

Number of pages | 2 |

DOIs | |

State | Published - 1999 |

Event | Proceedings of the 1999 15th Annual Symposium on Computational Geometry - Miami Beach, FL, USA Duration: Jun 13 1999 → Jun 16 1999 |

### Conference

Conference | Proceedings of the 1999 15th Annual Symposium on Computational Geometry |
---|---|

City | Miami Beach, FL, USA |

Period | 6/13/99 → 6/16/99 |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Geometry and Topology
- Computational Mathematics

## Fingerprint Dive into the research topics of 'Uncluttering force-directed graph layouts'. Together they form a unique fingerprint.

## Cite this

*Uncluttering force-directed graph layouts*. 425-426. Paper presented at Proceedings of the 1999 15th Annual Symposium on Computational Geometry, Miami Beach, FL, USA, . https://doi.org/10.1145/304893.305003