Zobrazeno 1 - 10
of 66
pro vyhledávání: '"Chiu, Man-Kwun"'
Autor:
Aichholzer, Oswin, Chiu, Man-Kwun, Hoang, Hung P., Hoffmann, Michael, Kynčl, Jan, Maus, Yannic, Vogtenhuber, Birgit, Weinberger, Alexandra
For a drawing of a labeled graph, the rotation of a vertex or crossing is the cyclic order of its incident edges, represented by the labels of their other endpoints. The extended rotation system (ERS) of the drawing is the collection of the rotations
Externí odkaz:
http://arxiv.org/abs/2303.07401
Autor:
Chiu, Man-Kwun, Felsner, Stefan, Scheucher, Manfred, Schröder, Felix, Steiner, Raphael, Vogtenhuber, Birgit
Felsner, Hurtado, Noy and Streinu (2000) conjectured that arrangement graphs of simple great-circle arrangements have chromatic number at most $3$. Motivated by this conjecture, we study the colorability of arrangement graphs for different classes of
Externí odkaz:
http://arxiv.org/abs/2205.08181
Autor:
Chiu, Man-Kwun, Felsner, Stefan, Scheucher, Manfred, Schröder, Felix, Steiner, Raphael, Vogtenhuber, Birgit
Publikováno v:
In European Journal of Combinatorics October 2024 121
Autor:
Abel, Zachary, Akitaya, Hugo, Chiu, Man-Kwun, Demaine, Erik D., Demaine, Martin L., Hesterberg, Adam, Korman, Matias, Lynch, Jayson, van Renssen, André, Roeloffzen, Marcel
We study Snipperclips, a computer puzzle game whose objective is to create a target shape with two tools. The tools start as constant-complexity shapes, and each tool can snip (i.e., subtract its current shape from) the other tool. We study the compu
Externí odkaz:
http://arxiv.org/abs/2105.08305
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:
Chiu, Man-Kwun, Demaine, Erik D., Diomidova, Jenny, Eppstein, David, Hearn, Robert A., Hesterberg, Adam, Korman, Matias, Parada, Irene, Rudoy, Mikhail
Given a set of point sites, a sona drawing is a single closed curve, disjoint from the sites and intersecting itself only in simple crossings, so that each bounded region of its complement contains exactly one of the sites. We prove that it is NP-har
Externí odkaz:
http://arxiv.org/abs/2007.15784
We consider the problem of digitalizing Euclidean segments. Specifically, we look for a constructive method to connect any two points in $\mathbb{Z}^d$. The construction must be {\em consistent} (that is, satisfy the natural extension of the Euclidea
Externí odkaz:
http://arxiv.org/abs/2006.14059
The classic Ham-Sandwich theorem states that for any $d$ measurable sets in $\mathbb{R}^d$, there is a hyperplane that bisects them simultaneously. An extension by B\'ar\'any, Hubard, and Jer\'onimo [DCG 2008] states that if the sets are convex and \
Externí odkaz:
http://arxiv.org/abs/2003.09266
Ailon et al. [SICOMP'11] proposed self-improving algorithms for sorting and Delaunay triangulation (DT) when the input instances $x_1,\cdots,x_n$ follow some unknown \emph{product distribution}. That is, $x_i$ comes from a fixed unknown distribution
Externí odkaz:
http://arxiv.org/abs/2003.08329
Autor:
Chiu, Man-Kwun, Felsner, Stefan, Scheucher, Manfred, Schnider, Patrick, Steiner, Raphael, Valtr, Pavel
Let ${\cal L}$ be an arrangement of $n$ lines in the Euclidean plane. The \emph{$k$-level} of ${\cal L}$ consists of all vertices $v$ of the arrangement which have exactly $k$ lines of ${\cal L}$ passing below $v$. The complexity (the maximum size) o
Externí odkaz:
http://arxiv.org/abs/1911.02408