McGill University - School of Computer Science
Computational Geometry Seminar
Everybody is welcome.
|
DATE:
|
Wednesday, March 4th, 1998
|
|
TIME:
|
12h00 - 13h00
|
|
PLACE:
|
McConnell 320
|
|
TITLE:
|
Routing Edges in Graphs.
|
|
SPEAKER:
|
Emden R. Gansner, AT&T Laboratories.
|
Unless integrated within a given style, as in orthogonal layouts,
drawing the edges of a graph is often handled as an afterthought,
employing straight lines or, at best, polylines. This approach
can significantly impair the clarity of a drawing, especially one
using non-point nodes. In this talk, I advocate routing a smooth
curve between two endpoints. Although routing is a well-studied
problem in various domains and contexts, such as robotics, VLSI design
or the classic problem of Dubins, the resulting paths do not seem
appropriate for the edges of a graph. I describe two methods for drawing
edges as smooth curves that have the desired appearance. Both are based
on cubic Bezier spline approximations of the shortest path connecting
the edge's endpoints.
Joint work with J. Abello, D. Dobkin, E. Koutsofios and S. North.
This information is available at
http://cgm.cs.mcgill.ca/~therese/seminar.
Direct questions, comments, additions to and removals from the mailing list, and
suggestions for speakers to Therese Biedl at
therese@cgm.cs.mcgill.ca.