Given a set of n points in the plane and a collection of k halving lines of P ℓ1, . . . , ℓk indexed according to the increasing order of their slopes, we denote by d(ℓj, ...
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
- In biometric authentication, feature information of each enrolled person's biometric information is enrolled as templates. Secure databases or anti-tampered devices store th...
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...