Optimal and suboptimal robust algorithms for proximity graphs (Q1873154)
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: Optimal and suboptimal robust algorithms for proximity graphs |
scientific article; zbMATH DE number 1912422
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal and suboptimal robust algorithms for proximity graphs |
scientific article; zbMATH DE number 1912422 |
Statements
Optimal and suboptimal robust algorithms for proximity graphs (English)
0 references
19 May 2003
0 references
The authors show a numerically robust algorithm that computes Gabriel graphs in quadratic time and degree 2. Also it is shown how a \(\rho\)-spectrum can be computed in optimal \(O(n^2)\) time.
0 references
computational geometry
0 references
graph drawing
0 references
proximity graphs
0 references
beta skeletons
0 references
robustness
0 references
algorithm
0 references
Gabriel graphs
0 references
0 references
0 references
