A New Method for Efficiently Generating Planar Graph Visibility Representations

Boyer, John M. (2006) A New Method for Efficiently Generating Planar Graph Visibility Representations. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005 , pp. 508-511(Official URL: http://dx.doi.org/10.1007/11618058_47).

Full text not available from this repository.

Abstract

A planar graph visibility representation maps each vertex to a horizontal segment at a vertical position and each edge to a vertical segment at a horizontal position such that each edge segment terminates at the vertical positions of its endpoint vertices and intersects no other horizontal vertex segments. [part of Introduction]

Item Type: Conference Poster
Additional Information: 10.1007/11618058_47
Classifications: P Styles > P.900 Visibility
M Methods > M.600 Planar
P Styles > P.540 Planar
URI: http://gdea.informatik.uni-koeln.de/id/eprint/727

Actions (login required)

View Item View Item