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.
Read more about Relative Neighborhood Graph: Algorithms, Generalizations, Related Graphs
Famous quotes containing the words relative, neighborhood and/or graph:
“It is an interesting question how far men would retain their relative rank if they were divested of their clothes.”
—Henry David Thoreau (1817–1862)
“The world has narrowed to a neighborhood before it has broadened to brotherhood.”
—Lyndon Baines Johnson (1908–1973)
“When producers want to know what the public wants, they graph it as curves. When they want to tell the public what to get, they say it in curves.”
—Marshall McLuhan (1911–1980)