Peter Eades

Last updated

Peter Eades at the Workshop on Theory and Practice of Graph Drawing, 2012 Peter Eades WTPGD.jpg
Peter Eades at the Workshop on Theory and Practice of Graph Drawing, 2012

Peter D. Eades (born 8 January 1952) [1] is an Australian computer scientist, a professor in the School of Information Technologies at the University of Sydney, known for his expertise in graph drawing.

Eades received his bachelor's degree in mathematics from Australian National University in 1974, and his Ph.D. in mathematics from the same university in 1977 under the supervision of Jennifer Seberry. [2] He then did postdoctoral studies at the University of Waterloo before taking an academic position at the University of Queensland, where he remained until 1991. He was a professor of computer science at the University of Newcastle from 1992 to 1999, and joined the University of Sydney faculty in 2000. As well as his faculty position at Sydney, Eades is also a distinguished researcher at NICTA. [3] [4]

Eades is the co-author (with Giuseppe Di Battista, Roberto Tamassia, and Ioannis G. Tollis) of the book Graph drawing: Algorithms for the visualization of graphs, [5] and of the associated survey "Algorithms for drawing graphs: an annotated bibliography". [6] He has also written many highly cited research papers in graph drawing, on topics including spring algorithms, [7] performance speed up with N-body methods, [8] maintenance of the "mental map" in dynamically changing drawings, [9] heuristics for reducing the number of edge crossings in layered graph drawings, [10] and visual display of clustering information in graphs. [11] He was the keynote speaker at the 12th IEEE Symposium on Information Visualization in 2006, [4] was one of three invited speakers at the 19th International Symposium on Algorithms and Computation in 2008, [12] and was one of two invited speakers at the 18th International Symposium on Graph Drawing in 2010. [13] He has been the doctoral advisor of over 30 graduate students. [3]

A workshop in honor of Eades' 60th birthday was held in 2012, as part of the International Symposium on Graph Drawing. [14]

Related Research Articles

Graph drawing Visualization of node-link graphs

Graph drawing is an area of mathematics and computer science combining methods from geometric graph theory and information visualization to derive two-dimensional depictions of graphs arising from applications such as social network analysis, cartography, linguistics, and bioinformatics.

Force-directed graph drawing

Force-directed graph drawing algorithms are a class of algorithms for drawing graphs in an aesthetically-pleasing way. Their purpose is to position the nodes of a graph in two-dimensional or three-dimensional space so that all the edges are of more or less equal length and there are as few crossing edges as possible, by assigning forces among the set of edges and the set of nodes, based on their relative positions, and then using these forces either to simulate the motion of the edges and nodes or to minimize their energy.

Software visualization or software visualisation refers to the visualization of information of and related to software systems—either the architecture of its source code or metrics of their runtime behavior—and their development process by means of static, interactive or animated 2-D or 3-D visual representations of their structure, execution, behavior, and evolution.

Graph embedding Embedding a graph in a topological space, often Euclidean

In topological graph theory, an embedding of a graph on a surface is a representation of on in which points of are associated with vertices and simple arcs are associated with edges in such a way that:

International Symposium on Graph Drawing Annual academic conference

The International Symposium on Graph Drawing (GD) is an annual academic conference in which researchers present peer reviewed papers on graph drawing, information visualization of network information, geometric graph theory, and related topics.

In the mathematical field of graph theory, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving the edge–vertex connectivity.

János Pach Hungarian mathematician

János Pach is a mathematician and computer scientist working in the fields of combinatorics and discrete and computational geometry.

Layered graph drawing Graph drawing with vertices in horizontal layers

Layered graph drawing or hierarchical graph drawing is a type of graph drawing in which the vertices of a directed graph are drawn in horizontal rows or layers with the edges generally directed downwards. It is also known as Sugiyama-style graph drawing after Kozo Sugiyama, who first developed this drawing style.

Kozo Sugiyama was a Japanese computer scientist and graph drawing researcher.

Angular resolution (graph drawing)

In graph drawing, the angular resolution of a drawing of a graph is the sharpest angle formed by any two edges that meet at a common vertex of the drawing.

Dorothea Wagner is a German computer scientist, known for her research in graph drawing, route planning, and social network analysis. She heads the Institute of Theoretical Informatics at the Karlsruhe Institute of Technology.

Meurs Challenger is an online graph visualization program, with data analysis and browsing.

Circular layout

In graph drawing, a circular layout is a style of drawing that places the vertices of a graph on a circle, often evenly spaced so that they form the vertices of a regular polygon.

Arc diagram Graph drawing with vertices on a line

An arc diagram is a style of graph drawing, in which the vertices of a graph are placed along a line in the Euclidean plane, with edges being drawn as semicircles in one or both of the two halfplanes bounded by the line, or as smooth curves formed by sequences of semicircles. In some cases, line segments of the line itself are also allowed as edges, as long as they connect only vertices that are consecutive along the line. Variations of this drawing style in which the semicircles are replaced by convex curves of some other type are also commonly called arc diagrams.

RAC drawing

In graph drawing, a RAC drawing of a graph is a drawing in which the vertices are represented as points, the edges are represented as straight line segments or polylines, at most two edges cross at any point, and when two edges cross they do so at right angles to each other. In the name of this drawing style, "RAC" stands for "right angle crossing".

In graph drawing, planarization is a method of extending drawing methods from planar graphs to graphs that are not planar, by embedding the non-planar graphs within a larger planar graph.

In graph drawing, the area used by a drawing is a commonly used way of measuring its quality.

In graph drawing styles that represent the edges of a graph by polylines, it is desirable to minimize the number of bends per edge or the total number of bends in a drawing. Bend minimization is the algorithmic problem of finding a drawing that minimizes these quantities.

Petra Mutzel is a German computer scientist, a University Professor of computer science at the University of Bonn. Her research is in the areas of algorithm engineering, graph drawing and combinatorial optimization.

Simultaneous embedding is a technique in graph drawing and information visualization for visualizing two or more different graphs on the same or overlapping sets of labeled vertices, while avoiding crossings within both graphs. Crossings between an edge of one graph and an edge of the other graph are allowed.

References

  1. ↑ Birthdate as stated in introductory remarks by Seok-Hee Hong at Workshop on Theory and Applications of Graph Drawing.
  2. ↑ Peter D. Eades at the Mathematics Genealogy Project
  3. 1 2 Curriculum vitae, Univ. of Sydney, retrieved 2011-11-09.
  4. 1 2 Keynote Speaker, InfoVis 2006, retrieved 2011-11-09.
  5. ↑ Prentice Hall, 1999, ISBN   0-13-301615-3.
  6. ↑ Computational Geometry: Theory and Practice4 (5): 235–282, 1994, doi : 10.1016/0925-7721(94)00014-X.
  7. ↑ Eades, Peter (1984), "A heuristic for graph drawing", Congressus Numerantium, 42 (11): 149–160.
  8. ↑ Quigley, Aaron; Eades, Peter (2001), "FADE: Graph Drawing, Clustering, and Visual Abstraction", Proceedings of the 8th International Symposium on Graph Drawing (PDF), pp. 197–210, ISBN   3-540-41554-8 .
  9. ↑ Misue, Kazuo; Eades, Peter; Lai, Wei; Sugiyama, Kozo (1995), "Layout adjustment and the mental map", Journal of Visual Languages & Computing, 6 (2): 183–210, doi:10.1006/jvlc.1995.1010 .
  10. ↑ Eades, Peter; Wormald, Nicholas C. (1994), "Edge crossings in drawings of bipartite graphs", Algorithmica, 11 (4): 379–403, doi:10.1007/BF01187020, MR   1264270, S2CID   22476033 .
  11. ↑ Eades, Peter; Feng, Qing-Wen (1997), "Multilevel visualization of clustered graphs", Graph Drawing, Lecture Notes in Computer Science, vol. 1190, Springer-Verlag, pp. 101–112, doi: 10.1007/3-540-62495-3_41 , ISBN   978-3-540-62495-0 . Eades, Peter; Feng, Qing-Wen; Lin, Xuemin (1997), "Straight-line drawing algorithms for hierarchical graphs and clustered graphs", Graph Drawing, Lecture Notes in Computer Science, vol. 1190, Springer-Verlag, pp. 113–128, doi: 10.1007/3-540-62495-3_42 , ISBN   978-3-540-62495-0 .
  12. ↑ ISAAC 2008 program, retrieved 2011-11-09.
  13. ↑ Invited speakers, GD 2010, retrieved 2011-11-09.
  14. ↑ Workshop on Theory and Practice of Graph Drawing on the occasion of the 60th birthday of Peter Eades, Univ. of Sydney, retrieved 2012-08-13.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.