Associate Professor
Joined School 1999
Diploma (TU Berlin),
PhD (Rutgers)
| biedl@uwaterloo.ca | |
| Web | http://cs.uwaterloo.ca/~biedl |
| Voice | 519-888-4567 x34721 |
| Fax | 519-885-1208 |
|
| Therese Biedl
Associate Professor Joined School 1999 Diploma (TU Berlin),
|
Professor Biedl's research interest is in algorithms, especially for problems that involve graphs and geometry.
One of her major research interests is graph drawing, i.e., how to create (automatically) a nice-looking drawing of a given graph. Professor Biedl worked both on theoretical aspects (which graphs can be represented in which way?) and on practical aspects (development of heuristics, implementation and experimentation). She was a Research Scientist with Tom Sawyer Software, a Bay Area company that specializes in Graph Drawing software, where she was involved in designing, building and refining the orthogonal layout library of their main product.
Professor Biedl also works on reconstructing geometric objects from partial information. For example, can a polyhedron be reconstructed from its edge-vertex graph and some other information? Prof. Biedl has also worked on reconstructing polygons and polyhedra from projections and/or thickness information, a problem that relates to image processing, X-ray crystallography, and geometric games.
T. Biedl, Small drawings of series-parallel graphs and other subclasses of planar graphs, accepted in Discrete and Computational Geometry in 2010, (21 pages), 2010.
T. Biedl and B. Genc, Cauchy's Theorem for Orthogonal Polyhedra of Genus 0, Proc. European Symposium on Algorithm (ESA'09), vol. 5757 of Lecture Notes in Computer Science, Springer-Verlag, pp. 71-82, 2009.
T. Biedl, M. Hasan, and A. Lopez-Ortiz. Reconstructing convex polygons and polyhedra from edge and face counts in orthogonal projections. Foundations of Software Technology and Theoretical Computer Science, Lectures Notes in Computer Science 4855, pp. 400-411, 2007.
T. Biedl, A. Lubiw, and M. Spriggs. Morphing Planar Graphs While Preserving Edge Directions. Graph Drawing `05, Lecture Notes in Computer Science 3843, pp. 13-24, 2006.
T. Biedl, P. Bose, E. Demaine, and A. Lubiw. Efficient Algorithms for Petersen's Matching Theorem, Journal of Algorithms, 38:110-134, 2001.
T. Biedl and G. Kant. A better heuristic for orthogonal graph drawings. Computational Geometry: Theory and Applications, 9:159-180, 1998.
David R. Cheriton School of Computer Science
University of Waterloo
Waterloo, Ontario, Canada N2L 3G1
Tel: 519-888-4567 x33293
Fax: 519-885-1208
Contact | Feedback: cs-webmaster@cs.uwaterloo.ca | David R. Cheriton School of Computer Science | Faculty of Mathematics
Last modified: Monday, 10-Jan-2011 13:10:22 EST
