Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Cleve, Jonas"'
Autor:
Cleve, Jonas, Grelier, Nicolas, Knorr, Kristin, Löffler, Maarten, Mulzer, Wolfgang, Perz, Daniel
Let $\mathcal{D}$ be a set of straight-line segments in the plane, potentially crossing, and let $c$ be a positive integer. We denote by $P$ the union of the endpoints of the straight-line segments of $\mathcal{D}$ and of the intersection points betw
Externí odkaz:
http://arxiv.org/abs/2209.02103
Autor:
Cleve, Jonas
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 corresponding nodes. In this work we focus on graphs without embedding, i.
Externí odkaz:
http://arxiv.org/abs/2010.01886
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 between the corresponding nodes. We provide a gadget-based reduction to sho
Externí odkaz:
http://arxiv.org/abs/2010.01881
Autor:
Cleve, Jonas, Mulzer, Wolfgang
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, the input resides in a read-only array that can be accessed at random.
Externí odkaz:
http://arxiv.org/abs/1904.03050
Autor:
Chiu, Man-Kwun, Cleve, Jonas, Klost, Katharina, Korman, Matias, Mulzer, Wolfgang, van Renssen, André, Roeloffzen, Marcel, Willert, Max
Let $P$ be an $x$-monotone orthogonal polygon with $n$ vertices. We call $P$ a simple histogram if its upper boundary is a single edge; and a double histogram if it has a horizontal chord from the left boundary to the right boundary. Two points $p$ a
Externí odkaz:
http://arxiv.org/abs/1902.06599
Autor:
Cleve, Jonas, Mulzer, Wolfgang
Publikováno v:
Computational Geometry: Theory and Applications (CGTA), 91, 2020, Article 101667
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 until they are either stuck at an obstacle or reach the beacon's locati
Externí odkaz:
http://arxiv.org/abs/1712.07416
Autor:
Cleve, Jonas, Mulzer, Wolfgang
Publikováno v:
In Computational Geometry: Theory and Applications December 2020 91