DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\). (Q1401886): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56047094, #quickstatements; #temporary_batch_1705502051474 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:00, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\). |
scientific article |
Statements
DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\). (English)
0 references
24 September 2003
0 references
uniform grids
0 references
