Given a set of n colored points with k colors in the plane, we study the...
This paper studies empty squares in arbitrary orientation among a set P ...
In this paper, we study the problem of computing a minimum-width double-...
Given a simple polygon P and a set Q of points contained in P, we
consid...
In this paper, we study the problem of computing a minimum-width axis-al...
In this paper, we address the minimum-area rectangular and square annulu...
An annulus is, informally, a ring-shaped region, often described by two
...
In the range closest pair problem, we want to construct a data structure...
Let P be a simple polygon of n vertices. We consider two-point L_1
short...
We introduce the family of k-gap-planar graphs for k ≥ 0, i.e., graphs
t...