Path router for graph drawing

David P. Dobkin, Eraden R. Gansner, Eleftherios Koutsofios, Stephen C. North

Research output: Contribution to conferencePaper

2 Scopus citations

Abstract

A good graph layout can clarify complex relationship among objects. A typical positioning of a node involves placing a label that identifies the object represented by the node. Once the nodes are placed, where edge routings that are easy to read is needed. This involves generating smooth curves that avoid touching unrelated nodes and edges. Two algorithms are animated to solve two cases of the routing problem: the first case is routing within an simple polygon; the second is routing around holes in a polygon.

Original languageEnglish (US)
Pages415-416
Number of pages2
StatePublished - Jan 1 1998
EventProceedings of the 1998 14th Annual Symposium on Computational Geometry - Minneapolis, MN, USA
Duration: Jun 7 1998Jun 10 1998

Other

OtherProceedings of the 1998 14th Annual Symposium on Computational Geometry
CityMinneapolis, MN, USA
Period6/7/986/10/98

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Path router for graph drawing'. Together they form a unique fingerprint.

  • Cite this

    Dobkin, D. P., Gansner, E. R., Koutsofios, E., & North, S. C. (1998). Path router for graph drawing. 415-416. Paper presented at Proceedings of the 1998 14th Annual Symposium on Computational Geometry, Minneapolis, MN, USA, .