Erd˝os, Purdy, and Straus conjectured that the number of distinct (nonzero) areas of the triangles determined by n noncollinear points in the plane is at least n−1 2 , which is...
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
The paper presents a reflection on some of the basic assumptions and philosophy of reference point approaches, stressing their unique concentration on the sovereignty of the subje...
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...