Computing relative neighbourhood graphs in the plane (Q1082094)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing relative neighbourhood graphs in the plane |
scientific article; zbMATH DE number 3972240
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing relative neighbourhood graphs in the plane |
scientific article; zbMATH DE number 3972240 |
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
