On Orthogonally Convex Drawings of Plane Graphs (Extended Abstract)

Chang, Yi-Jun and Yen, Hsu-Chun (2013) On Orthogonally Convex Drawings of Plane Graphs (Extended Abstract). In: 21st International Symposium, GD 2013, September 23-25, 2013 , pp. 400-411(Official URL: http://dx.doi.org/10.1007/978-3-319-03841-4_35).

Full text not available from this repository.

Abstract

We investigate the bend minimization problem with respect to a new drawing style called orthogonally convex drawing, which is orthogonal drawing with an additional requirement that each inner face is drawn as an orthogonally convex polygon. For the class of bi-connected plane graphs of maximum degree 3, we give a necessary and sufficient condition for the existence of a no-bend orthogonally convex drawing, which in turn, enables a linear time algorithm to check and construct such a drawing if one exists. We also develop a flow network formulation for bend-minimization in orthogonally convex drawings, yielding a polynomial time solution for the problem. An interesting application of our orthogonally convex drawing is to characterize internally triangulated plane graphs that admit floorplans using only orthogonally convex modules subject to certain boundary constraints.

Item Type: Conference Paper
Classifications: G Algorithms and Complexity > G.210 Bends
P Styles > P.600 Poly-line > P.600.700 Orthogonal
Divisions: UNSPECIFIED
Depositing User: Administration GDEA
Date Deposited: 13 Aug 2014 15:43
Last Modified: 13 Aug 2014 15:43
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1392

Actions (login required)

View Item View Item