For a drawing of a labeled graph, the rotation of a vertex or crossing i...
Felsner, Hurtado, Noy and Streinu (2000) conjectured that arrangement gr...
We study Snipperclips, a computer puzzle game whose objective is to crea...
Weak unit disk contact graphs are graphs that admit a representation of ...
Given a set of point sites, a sona drawing is a single closed curve, dis...
We consider the problem of digitalizing Euclidean segments. Specifically...
The classic Ham-Sandwich theorem states that for any d measurable sets i...
Ailon et al. [SICOMP'11] proposed self-improving algorithms for sorting ...
Let A be an arrangement of n lines in the Euclidean plane. The
<i>k-leve...
Let M⊂R^d be a compact, smooth and boundaryless
manifold with dimension ...
Let P be an x-monotone orthogonal polygon with n vertices. We call P
a s...
We study self-improving sorting with hidden partitions. Our result is an...
We study the computation of the diameter and radius under the rectilinea...
We prove a geometric version of the graph separator theorem for the unit...