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.
随便看	cuninghams的意思 cunisil的意思 Cunisset test的意思 cunit的意思 cunjah的意思 Cunjamba的意思 Cunjevoi的意思 cunjevois的意思 Cunji的意思 cunkou的意思 cunkou pulse的意思 cunkou pulse,cun的意思 Cunlhat的意思 Cunliffe的意思 cunliffes的意思 Cunn.的意思 Cunnamulla的意思 cunnane的意思 cunnanes的意思 cunne的意思 cun的意思 cunner的意思 cunnerman的意思 cunner的意思 Cunnersdorf twin law的意思