
Snipperclips: Cutting Tools into Desired Polygons using Themselves
We study Snipperclips, a computer puzzle game whose objective is to crea...
read it

Recognizing embedded caterpillars with weak unit disk contact representations is NPhard
Weak unit disk contact graphs are graphs that admit a representation of ...
read it

New Results in Sona Drawing: Hardness and TSP Separation
Given a set of point sites, a sona drawing is a single closed curve, dis...
read it

Distance bounds for high dimensional consistent digital rays and 2D partiallyconsistent digital rays
We consider the problem of digitalizing Euclidean segments. Specifically...
read it

Computational Complexity of the αHamSandwich Problem
The classic HamSandwich theorem states that for any d measurable sets i...
read it

A Generalization of SelfImproving Algorithms
Ailon et al. [SICOMP'11] proposed selfimproving algorithms for sorting ...
read it

On the Average Complexity of the kLevel
Let A be an arrangement of n lines in the Euclidean plane. The <i>kleve...
read it

Implicit Manifold Reconstruction
Let M⊂R^d be a compact, smooth and boundaryless manifold with dimension ...
read it

Routing in Histograms
Let P be an xmonotone orthogonal polygon with n vertices. We call P a s...
read it

A note on selfimproving sorting with hidden partitions
We study selfimproving sorting with hidden partitions. Our result is an...
read it

Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain
We study the computation of the diameter and radius under the rectilinea...
read it

Balanced Line Separators of Unit Disk Graphs
We prove a geometric version of the graph separator theorem for the unit...
read it
ManKwun Chiu
is this you? claim profile