activity
20212025
most citedMorphing Rectangular Duals

1 citations · 2 across the 7 of their papers we have counts for

collaborators

8 papers

cs.CG2025

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…

cs.DM2023

Visualizing Geophylogenies -- Internal and External Labeling with Phylogenetic Tree Constraints

Jonathan Klawitter, Felix Klesen, Joris Y. Scholl +2

A geophylogeny is a phylogenetic tree (or dendrogram) where each leaf (e.g. biological taxon) has an associated geographic location (site). To clearly visualize a geophylogeny, the…

cs.DM2022

Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees

Jonathan Klawitter, Felix Klesen, Moritz Niederer +1

We consider the problem of drawing multiple gene trees inside a single species tree in order to visualize multispecies coalescent trees. Specifically, the drawing of the species tr…

cs.CG2022

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…

cs.CG2022

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]…

cs.CG2021★ 1 cited

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…

cs.CG2021

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…

cs.CG2021★ 1 cited

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…