DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\). (Q1401886): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56047094, #quickstatements; #temporary_batch_1705502051474 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56047094 / rank | |||
Normal rank | |||
Revision as of 15:40, 17 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
