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 and q by an edge whenever there does not exist a third point r that is closer to both p and q than they are to each other. This graph was proposed by Godfried Toussaint in 1980 as a way of defining a structure from a set of points that would match human perceptions of the shape of the set.

单词	Relative neighborhood graph
释义	Relative neighborhood graph 英语百科 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 and q by an edge whenever there does not exist a third point r that is closer to both p and q than they are to each other. This graph was proposed by Godfried Toussaint in 1980 as a way of defining a structure from a set of points that would match human perceptions of the shape of the set.
随便看	safety harnesses Safety hat safety hatch safety hat covering safety hats safety hat with broad edge safety haulm pulverizer Safety hazard safety head safety head lamp safety height safety height of ullage Safety helmet Safety helmets safety high boot safety hitch safety hoist safety hood safety hook safety hub safety impedance safety important item safety index safety indicator safety indicator catheter