1 citations · 2 across the 7 of their papers we have counts for
6 papers · 1 filter
Rectangular Duals on the Cylinder and the Torus
Therese Biedl, Philipp Kindermann, Jonathan Klawitter
A rectangular dual of a plane graph is a contact representation of by interior-disjoint rectangles such that (i) no four rectangles share a point, and (ii) the union of all…
Outside-Obstacle Representations with All Vertices on the Outer Face
Oksana Firman, Philipp Kindermann, Jonathan Klawitter +3
An obstacle representation of a graph consists of a set of polygonal obstacles and a drawing of as a visibility graph with respect to the obstacles: vertices are mapped to…
The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs
Ina Goeßmann, Jonathan Klawitter, Boris Klemz +5
The segment number of a planar graph is the smallest number of line segments needed for a planar straight-line drawing of . Dujmović, Eppstein, Suderman, and Wood [CGTA'07]…
Morphing Rectangular Duals
Steven Chaplick, Philipp Kindermann, Jonathan Klawitter +2
A rectangular dual of a plane graph is a contact representations of by interior-disjoint axis-aligned rectangles such that (i) no four rectangles share a point and (ii) the…
Algorithms for Floor Planning with Proximity Requirements
Jonathan Klawitter, Felix Klesen, Alexander Wolff
Floor planning is an important and difficult task in architecture. When planning office buildings, rooms that belong to the same organisational unit should be placed close to each…
Extending Partial Representations of Rectangular Duals with Given Contact Orientations
Steven Chaplick, Philipp Kindermann, Jonathan Klawitter +2
A rectangular dual of a graph is a contact representation of by axis-aligned rectangles such that (i)~no four rectangles share a point and (ii)~the union of all rectangles…