Explore relationships

Relative neighborhood graph

In computational geometry, the relative neighborhood graph (RNG) is an undirected graph defined on a set of points in the Euclidean plane by connecting two points p{\displaystyle p} and q{\displaystyle q} by an edge whenever there does not exist a third point r{\displaystyle r} that is closer to both p{\displaystyle p} and q{\displaystyle q} than they are to each other.

Use + to expand a branch. Click a topic name to open its summary.