An almost naive algorithm for finding relative neighbourhood graphs in $L_p$ metrics (Q3773333)
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: An almost naive algorithm for finding relative neighbourhood graphs in L_p metrics |
scientific article; zbMATH DE number 4033069
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An almost naive algorithm for finding relative neighbourhood graphs in $L_p$ metrics |
scientific article; zbMATH DE number 4033069 |
Statements
An almost naive algorithm for finding relative neighbourhood graphs in $L_p$ metrics (English)
0 references
1987
0 references
relative neighbourhood graph
0 references
\(L_ p\) metric
0 references
algorithm
0 references
0 references
0.8971566557884216
0 references
0.892386794090271
0 references
0.8910282850265503
0 references
0.8877780437469482
0 references
