Proving or Disproving Planar Straight-Line Embeddability onto Given Rectangles
Given a plane graph G = (V,E) and a rectangle we ask whether there exists a planar straight-line embedding of G onto the grid-points of the rectangle. For this NP-hard problem  some powerful heuristics have been developed to minimise the area of an embedding of a given graph [5,4]. Moreover, for particular families of graphs upper and lower bounds on the area have been proven . However, in the general case it is not possible to ensure whether there is an embedding that preserves a particular area restriction A = h ·w. We present an implementation based on a translation into SAT to tackle this kind of problems for small graphs. We only describe the direct encoding into CNF that turned out to be most suitable.
- 1.Open Graph Drawing Framework, http://www.ogdf.net
- 2.Frati, F., Patrignani, M.: A note on minimum area straight-line drawings of planar graphs. In: 15th International Symposium on Graph Drawing (2007)Google Scholar
- 3.Kottler, S.: Solver descriptions for the SAT competition (2009), satcompetition.orgGoogle Scholar
- 4.Krug, M.: Minimizing the area for planar straight-line grid drawings. Master’s thesis, University of Karlsruhe (2007)Google Scholar