A finite planar point set P is called a magic configuration if there is an assignment of positive weights to the points of P such that, for every line l determined by P, the sum o...
Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom...
There is a growing need to extract features from point sets for purposes like model classification, matching, and exploration. We introduce a technique for segmenting a point-sam...
The key step in the construction of the Delaunay triangulation of a finite set of planar points is to establish correctly whether a given point of this set is inside or outside t...
In this paper, we present a method for finding the closed form solutions to the problem of determining the pose of a camera with respect to a given set of parallel lines in 3D spac...
We prove that elements of the Weierstrass gap set of a pair of points may be used to define a geometric Goppa code which has minimum distance greater than the usual lower bound. We...