DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\). (Q1401886)
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: DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\). |
scientific article; zbMATH DE number 1966731
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\). |
scientific article; zbMATH DE number 1966731 |
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
