1 citations · 2 across the 7 of their papers we have counts for
11 papers
Coloring circle arrangements: New -chromatic planar graphs
Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher +3
Felsner, Hurtado, Noy and Streinu (2000) conjectured that arrangement graphs of simple great-circle arrangements have chromatic number at most . Motivated by this conjecture, we…
Snipperclips: Cutting Tools into Desired Polygons using Themselves
Zachary Abel, Hugo Akitaya, Man-Kwun Chiu +7
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…
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…
Distance bounds for high dimensional consistent digital rays and 2-D partially-consistent digital rays
Man-Kwun Chiu, Matias Korman, Martin Suderland +1
We consider the problem of digitalizing Euclidean segments. Specifically, we look for a constructive method to connect any two points in . The construction must be {\…
Computational Complexity of the -Ham-Sandwich Problem
Man-Kwun Chiu, Aruni Choudhary, Wolfgang Mulzer
The classic Ham-Sandwich theorem states that for any measurable sets in , there is a hyperplane that bisects them simultaneously. An extension by Bárány, Hubard,…
A Generalization of Self-Improving Algorithms
Siu-Wing Cheng, Man-Kwun Chiu, Kai Jin +1
Ailon et al. [SICOMP'11] proposed self-improving algorithms for sorting and Delaunay triangulation (DT) when the input instances follow some unknown \emph{product…