A fast algorithm for well-spaced points and approximate delaunay graphs (Q5174489): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:46, 8 February 2024
scientific article; zbMATH DE number 6405138
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
