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:
“The ungentlemanly expressions and gasconading conduct of yours relative to me yesterday was in true character of yourself and unmask you to the world and plainly show that they were ebullitions of a base mind ... and flow from a source devoid of every refined sentiment or delicate sensations.”
—Andrew Jackson (1767–1845)
“Such poverty as we have today in all our great cities degrades the poor, and infects with its degradation the whole neighborhood in which they live. And whatever can degrade a neighborhood can degrade a country and a continent and finally the whole civilized world, which is only a large neighborhood.”
—George Bernard Shaw (1856–1950)
“In this Journal, my pen is a delicate needle point, tracing out a graph of temperament so as to show its daily fluctuations: grave and gay, up and down, lamentation and revelry, self-love and self-disgust. You get here all my thoughts and opinions, always irresponsible and often contradictory or mutually exclusive, all my moods and vapours, all the varying reactions to environment of this jelly which is I.”
—W.N.P. Barbellion (1889–1919)