A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces (Q701788)
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: A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces |
scientific article; zbMATH DE number 2123192
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces |
scientific article; zbMATH DE number 2123192 |
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
