An almost naive algorithm for finding relative neighbourhood graphs in $L_p$ metrics

TL;DRAbstract

The relative neighhourhood graph (RNG) of a set of n points in a d-dimensional space contains an edge between a particular pair (v, w) of points if in the point set there is no other point for which the larger of the distances from v and w is smaller than the distance of v and w.

Chat with Paper

AI Agents for this Paper