Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints

Hong, Seok-Hee and Mader, Martin, Martin (2009) Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008 , pp. 278-283(Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_26).

Full text not available from this repository.

Abstract

In this paper we present a generalization of the shift method algorithm to obtain a straight-line grid drawing of a triconnected graph, where vertex representations have a certain specified size. We propose vertex representations having a rectangular shape. Additionally, one may demand maintainance of the criterion of strong visibility, that is, any possible line segment connecting two adjacent vertices cannot cross another vertex’ representation. We prove that the proposed method produces a straight-line grid drawing of a graph in linear time with an area bound, that is only extended by the size of the rectangles, compared to the bound of the original algorithm.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-642-00219-9_26
Classifications: P Styles > P.720 Straight-line
URI: http://gdea.informatik.uni-koeln.de/id/eprint/913

Actions (login required)

View Item View Item