A divide-and-conquer algorithm for constructing relative neighborhood graph (Q911282)
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: Publication:911282 |
scientific article; zbMATH DE number 4141500
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A divide-and-conquer algorithm for constructing relative neighborhood graph |
scientific article; zbMATH DE number 4141500 |
Statements
A divide-and-conquer algorithm for constructing relative neighborhood graph (English)
0 references
1990
0 references
computational geometry
0 references
divide-and-conquer algorithm
0 references
relative neighborhood graph
0 references
0.8798022270202637
0 references
0.8691359758377075
0 references
0.8570484519004822
0 references
0.8473692536354065
0 references
0.8450347781181335
0 references
