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 the normal view instead:
scientific article; zbMATH DE number 2123192
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.903677463531494
0 references
0.8946144580841064
0 references
0.8563359379768372
0 references
0.8503225445747375
0 references
0.8371144533157349
0 references
