A fast algorithm for well-spaced points and approximate Delaunay graphs (Q5174489)
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 6405138
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm for well-spaced points and approximate Delaunay graphs |
scientific article; zbMATH DE number 6405138 |
Statements
A fast algorithm for well-spaced points and approximate delaunay graphs (English)
0 references
17 February 2015
0 references
Delaunay refinement
0 references
mesh generation
0 references
output sensitive algorithms
0 references
Voronoi diagrams
0 references
Voronoi refinement
0 references
0.8045027852058411
0 references
0.800515353679657
0 references
0.7836936116218567
0 references
