1. This site uses cookies. By continuing to use this site, you are agreeing to our use of cookies. Learn More.

Relative Neighbourhood Graph

Discussion in 'Mathematics' started by Alexander Giles, Oct 8, 2018.

  1. Is there some way to efficiently compute the relative neighbourhood graph on $n$ Euclidean points in $\mathbb{R}^{d}$?

    Though one can simply define

    MaxDist[x_, y_, point_] := Max[{EuclideanDistance[x, y],
    EuclideanDistance[x, point],
    EuclideanDistance[point, y]}]

    and then use it on every ${n \choose 3}$ triple of points to determine if, among all possible alternatives, the link is shortest, perhaps a nicer method is available using a matrix of Euclidean distances?

    Login To add answer/comment

Share This Page