2:00 PM-3:00 PM
Chair: Karen Collins, Wesleyan University
Room: Earth Science Center Auditorium
A visibility representation of a graph maps vertices to geometric objects and edges to unobstructed lines of sight between these objects. The speaker will discuss this kind of representation in the context of graph drawing, the field which seeks good layouts for graphs for a variety of application areas. As the speaker will demonstrate, classical methods of combinatorics and algorithm design can be used to provide both visibility representations and non-existence proofs.
School of Computer Science
McGill University, Canada