A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces (Q701788): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00454-003-2870-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2073751737 / rank | |||
Normal rank | |||
Latest revision as of 21:41, 19 March 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
