DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\). (Q1401886): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: DBLP publication ID (P1635): journals/cad/CignoniMS98, #quickstatements; #temporary_batch_1731505720702 |
||
| (2 intermediate revisions by 2 users 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.1016/s0010-4485(97)00082-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2149616971 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/cad/CignoniMS98 / rank | |||
Normal rank | |||
Latest revision as of 15:03, 13 November 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
