Therese Biedl

Graph Drawing: How to map a graph to geometric objects (such as points in the planes for vertices and line segments for edges), under some objective function? Algorithms for near-planar graphs: If we know that a graph has special properties, how can we exploit this to make algorithms faster? | Computational Geometry and Mesh Generation; Advanced Graph Theory Research; Digital Image Processing Techniques; Graph Theory and Algorithms; Computer Graphics and Visualization Techniques

Therese Biedl is Professor at the University of Waterloo, affiliated with Computer Science. This summary considered 3 collected sources. Listed research or teaching areas include Graph Drawing: How to map a graph to geometric objects (such as points in the planes for vertices and line segments for edges), under some objective function? Algorithms for near-planar graphs: If we know that a graph has special properties, how can we exploit this to make algorithms faster?; Computational Geometry and Mesh Generation; Advanced Graph Theory Research; Digital Image Processing Techniques; Graph Theory and Algorithms; Computer Graphics and Visualization Techniques.