Abstract

We study sets of points in the two-dimensional Euclidean plane. The relative neighbourhood graph (RNG) of a point set is a straight line graph that connects two points from the point set if and only if there is no other point in the set that is closer to both points than they are to each other. A triangulation of a point set is a maximal set of nonintersecting line segments (called edges) with vertices in the point set. We introduce angular rectrictions in the triangulations. Using the well-known method of exclusion regions, we show that the relative neighbourhood graph is a part of every triangulation all of the angles of which are greater than or equal to 30°.

Citations