(I) We revisit the algorithmic problem of finding all triangles in a gra...
We introduce the Observation Route Problem () defined as
follows: Given ...
For a polygon P with holes in the plane, we denote by ϱ(P) the
ratio bet...
We revisit the problem of property testing for convex position for point...
Given an n-element point set in the plane, in how many ways can it be
pe...
For a finite set A⊂ℝ^d, let Δ(A) denote the spread
of A, which is the ra...
For a given family of shapes ℱ in the plane, we study what is
the lowest...
For a given shape S in the plane, one can ask what is the lowest possibl...
(I) We revisit the algorithmic problem of finding all triangles in a gra...
Given a sequence A of n numbers and an integer (target) parameter 1≤
i≤ ...
A unit disk graph G on a given set of points P in the plane is a
geometr...
According to a result of Arkin (2016), given n point pairs in the
plane...
Let P=(p_1, p_2, ..., p_n) be a polygonal chain. The stretch factor of
P...
Consider a totally ordered set S of n elements; as an example, a set of
...
We study several problems concerning convex polygons whose vertices lie ...
Arrangements of lines and pseudolines are fundamental objects in discret...
We study a maximization problem for geometric network design. Given a se...
We revisit the online Unit Clustering problem in higher dimensions: Give...