We consider the following problem. Let n 2, b 1 and q 2 be integers. Let R and B be two disjoint sets of n red points and bn blue points in the plane, respectively, such that no...
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Given a collection C of curves in the plane, the arrangement of C is the subdivision of the plane into vertices, edges and faces induced by the curves in C. Constructing arrangemen...
Let S be a set of r red points and b = r +2 blue points in general position in the plane. A line determined by them is said to be balanced if in each open half-plane bounded by th...