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:
“Three elements go to make up an idea. The first is its intrinsic quality as a feeling. The second is the energy with which it affects other ideas, an energy which is infinite in the here-and-nowness of immediate sensation, finite and relative in the recency of the past. The third element is the tendency of an idea to bring along other ideas with it.”
—Charles Sanders Peirce (1839–1914)
“The style, the house and grounds, and “entertainment” pass for nothing with me. I called on the king, but he made me wait in his hall, and conducted like a man incapacitated for hospitality. There was a man in my neighborhood who lived in a hollow tree. His manners were truly regal. I should have done better had I called on him.”
—Henry David Thoreau (1817–1862)
“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)