Computational geometry is the study of efficient algorithms for solving geometric problems.
This package provides functions for solving these and related problems in the case of planar points and the Euclidean distance metric. For points in the plane, these neighborhoods are polygons. The Delaunay triangulation of S is a triangulation of the points in S such that no triangle contains a point of S in its circumcircle. This is equivalent to connecting the points in S according to whether their neighborhood polygons share a common side. This loads the package.