DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\). (Q1401886): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q205093 |
Changed an Item |
||
| Property / author | |||
| Property / author: Roberto Scopigno / rank | |||
Normal rank | |||
Revision as of 21:37, 10 February 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
