Next: Folding Rulers Inside Up: Geometric Algorithms Previous: Reconfiguration with Line

On a Visibility Representation for Graphs in Three Dimensions

Authors: [tex2html_wrap4198]P. Bose, H. Everett, S. Fekete, A. Lubiw, H. Meijer, K. Romanik, T. Shermer, S. Whitesides

Investigator username: sue

Category: perception

Subcategory: geometric algorithms

Visibility representations of graphs map vertices to sets in Euclidean space and express edges as visibility relations between these sets. We study a 3d visibility representation in which vertices are represented by axis-aligned rectangles parallel to the xy plane. Vertices are adjacent in the graph if and only if the rectangles that represent them see each other along a common line of sight parallel to the z axis.


baron@cim.mcgill.ca