Computing relative neighbourhood graphs in the plane (Q1082094): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0031-3203(86)90012-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2013663950 / rank | |||
Normal rank | |||
Revision as of 02:57, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing relative neighbourhood graphs in the plane |
scientific article |
Statements
Computing relative neighbourhood graphs in the plane (English)
0 references
1986
0 references
The paper presents two new algorithms for constructing the relative neighborhood graph (RNG) in two-dimensional Euclidean space. The method is to determine a supergraph for RNG which can be thinned efficiently from the extra edges.
0 references
graph algorithms
0 references
pattern recognition
0 references
nearest neighbour search
0 references
