At the International Workshop on Combinatorial Image Analysis, held in Brno, Czech Republic, our URGE To Compute team received the Best Student Paper Award for their presentation, "On Intersection ...

Helly’s Theorem: A classical result which states that for a family of convex sets in ℝd, if every d+1 of them intersect, then the whole family has a non-empty intersection.

FERENC FODOR, VIKTOR VÍGH, VARIANCE ESTIMATES FOR RANDOM DISC-POLYGONS IN SMOOTH CONVEX DISCS, Journal of Applied Probability, Vol. 55, No. 4 (2018), pp. 1143-1157 ...

In this paper we consider location-allocation problems in which the region to be served is a convex polygon having a uniform demand distribution. Both single and multifacility formulations are ...

At the International Workshop on Combinatorial Image Analysis, held in Brno, Czech Republic, our URGE To Compute team received the Best Student Paper Award for their presentation, "On Intersection ...