A circle C is occluded by a set of circles C1, . . . , Cn if every line that intersects C also intersects at least one of the Ci, i = 1, . . . , n. In this paper, we focus on dete...
Natasa Jovanovic, Jan H. M. Korst, Augustus J. E. ...
Let S be a set of points in the plane. What is the minimum possible dilation of all plane graphs that contain S? Even for a set S as simple as five points evenly placed on the ci...
Given a set S of line segments in the plane, we introduce a new family of partitions of the convex hull of S called segment triangulations of S. The set of faces of such a triangul...
We prove a conjecture of Erdos, Purdy, and Straus on the number of distinct areas of triangles determined by a set of n points in the plane. We show that if P is a set of n points...
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...