We consider the following problem. Let n 2, b 1 and q 2 be integers. Let R and B be two disjoint sets of n red points and bn blue points in the plane, respectively, such that no...
By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respective...
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...
This paper discusses a method to watermark a 3D shape model defined as a set of unoriented points. Our approach is to perform frequency domain analysis of the shape of the 3D poin...
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...