2 citations · 4 across the 5 of their papers we have counts for
6 papers
Nearest-Neighbor Decompositions of Drawings
Jonas Cleve, Nicolas Grelier, Kristin Knorr +3
Let be a set of straight-line segments in the plane, potentially crossing, and let be a positive integer. We denote by the union of the endpoints of the strai…
Weak Unit Disk Contact Representations for Graphs without Embedding
Jonas Cleve
Weak unit disk contact graphs are graphs that admit representing nodes as a collection of internally disjoint unit disks whose boundaries touch if there is an edge between the corr…
Recognizing embedded caterpillars with weak unit disk contact representations is NP-hard
Man-Kwun Chiu, Jonas Cleve, Martin Nöllenburg
Weak unit disk contact graphs are graphs that admit a representation of the nodes as a collection of internally disjoint unit disks whose boundaries touch if there is an edge betwe…
An Experimental Study of Algorithms for Geodesic Shortest Paths in the Constant-Workspace Model
Jonas Cleve, Wolfgang Mulzer
We perform an experimental evaluation of algorithms for finding geodesic shortest paths between two points inside a simple polygon in the constant-workspace model. In this model, t…
Routing in Histograms
Man-Kwun Chiu, Jonas Cleve, Katharina Klost +5
Let be an -monotone orthogonal polygon with vertices. We call a simple histogram if its upper boundary is a single edge; and a double histogram if it has a horizonta…
Combinatorics of Beacon-based Routing in Three Dimensions
Jonas Cleve, Wolfgang Mulzer
A beacon is a point-like object which can be enabled to exert a magnetic pull on other point-like objects in space. Those objects then move towards the beacon in a greedy fashion u…