Relative neighborhood graph

Relative neighborhood graph

In computational geometry, the relative neighborhood graph (RNG) was proposed by Godfried Toussaint in 1980. [G. T. Toussaint, “The relative neighborhood graph of a finite planar set,” Pattern Recognition, vol. 12, pp. 261-268, 1980.] There has been a lot of research on this kind of graph. [ [http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=163414 Welcome to IEEE Xplore 2.0: Relative neighborhood graphs and their relatives ] ] [ [http://portal.acm.org/citation.cfm?id=322386 The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees ] ]

Definition

The relative neighborhood graph of a graph "G" = ("V", "E"), denoted by RNG("G"), is the set of all edges "uv" є "E" such that there is no vertex or point "w" where "uw" є "E", "wv" є "E" and ||"uw"|| < ||"uv"|| and ||"wv"|| < ||"uv"||.

References


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Grafo de vecindad relativa — En geometría computacional, el Grafo de vecindad relativa (Relative Neighborhood Graph, RNG por sus siglas en inglés) es el subgrafo que extrae las aristas entre los vértices más próximos (respecto a una métrica dada) de un grafo genérico. Fue… …   Wikipedia Español

  • List of mathematics articles (R) — NOTOC R R. A. Fisher Lectureship Rabdology Rabin automaton Rabin signature algorithm Rabinovich Fabrikant equations Rabinowitsch trick Racah polynomials Racah W coefficient Racetrack (game) Racks and quandles Radar chart Rademacher complexity… …   Wikipedia

  • FLAME clustering — Fuzzy clustering by Local Approximation of MEmberships (FLAME) is a novel data clustering algorithm that defines clusters in the dense parts of a dataset and performs cluster assignment solely based on the neighborhood relationships among objects …   Wikipedia

  • Logarithm — The graph of the logarithm to base 2 crosses the x axis (horizontal axis) at 1 and passes through the points with coordinates (2, 1), (4, 2), and (8, 3) …   Wikipedia

  • Info-gap decision theory — is a non probabilistic decision theory that seeks to optimize robustness to failure – or opportuneness for windfall – under severe uncertainty,[1][2] in particular applying sensitivity analysis of the stability radius type[3] to perturbations in… …   Wikipedia

  • Newton's method — In numerical analysis, Newton s method (also known as the Newton–Raphson method), named after Isaac Newton and Joseph Raphson, is a method for finding successively better approximations to the roots (or zeroes) of a real valued function. The… …   Wikipedia

  • Pittsburgh, Pennsylvania — Infobox Settlement official name = City of Pittsburgh nickname = City of Bridges, Steel City, The Burgh, Iron City, The Smoky City, Steel Town, The College City, Roboburgh motto = Benigno Numine ( With the Benevolent Deity also translated as By… …   Wikipedia

  • Pittsburgh — This article is about the city in Pennsylvania. For the region, see Pittsburgh metropolitan area. For other uses, see Pittsburgh (disambiguation). City of Pittsburgh   City   …   Wikipedia

  • Maxima and minima — For other uses, see Maxima (disambiguation) and Maximum (disambiguation). For use in statistics, see Maximum (statistics). Local and global maxima and minima for cos(3πx)/x, 0.1≤x≤1.1 In mathematics, the maximum and minimum (plural: maxima and… …   Wikipedia

  • Jerusalem — al Quds redirects here. For other uses, see al Quds (disambiguation). For other uses, see Jerusalem (disambiguation). Jerusalem …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”