A low arithmetic-degree algorithm for computing proximity graphs (Q4557732)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6984962
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A low arithmetic-degree algorithm for computing proximity graphs |
scientific article; zbMATH DE number 6984962 |
Statements
A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs (English)
0 references
26 November 2018
0 references
robust computation
0 references
geometric graphs
0 references
Euclidean minimum spanning tree
0 references
arithmetic degree
0 references
0 references
0 references
0 references
0.8247355222702026
0 references
0.8149940371513367
0 references
0.8005605936050415
0 references
0.7971633076667786
0 references
