Examples of such areas include pattern recognition and classification, geographic variation analysis, geographic information systems, computational geometry, computational morphology, and computer vision. Recent results in this new area of research considered the proximity drawability of classes of graphs that have relevance in graph drawing applications. J. D. Radke. On the Shape of a Set of Points . Clearly, fast and reliable algorithms to construct the wanted proximity subgraphs of the Delaunay diagram play a crucial role within this approach.
Several questions remain open.
For example, 1. Extend the result of this paper to the robust computation of other proximity subgraphs of the Delaunay diagram. For values of fi such that 1 fi 2, fi Gamma graphs are subgraphs of the Delaunay diagram. On the shape of a set of points . North-Holland, Amsterdam, Netherlands, 1988.