A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces (Q701788): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:53, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces |
scientific article |
Statements
A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces (English)
0 references
16 December 2004
0 references
Voronoi diagrams
0 references
