It is proved that the flip graph of geometric triangulations with fixed vertices of a flat torus or a closed hyperbolic surface is connected and upper bounds are given on the number of edge flips that are necessary to transform any geometric Triangulation on such a surface into a Delaunay triangulation.Expand

We consider k-threshold functions of n variables, i.e. the functions representable as the conjunction of k threshold functions. For n = 2, k = 2, we give upper bounds for the cardinality of the… Expand

Theoretical aspects of the Integral Image algorithm's continuous version are discussed, including a novel integration method over curves in the plane and a theorem that extends the algorithm to general continuous domains.Expand

A very general definition of a Polygon is presented to obtain the definition of faces and holes of a polygon and a generalization of Pick’s Theorem is proved for very general lattice polygons.Expand