A parallel algorithm based on convexity for the computing of Delaunay tessellation (Q664607): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q57659439, #quickstatements; #temporary_batch_1712286835472 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q57659439 / rank | |||
Normal rank |
Revision as of 05:30, 5 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A parallel algorithm based on convexity for the computing of Delaunay tessellation |
scientific article |
Statements
A parallel algorithm based on convexity for the computing of Delaunay tessellation (English)
0 references
2 March 2012
0 references
geometric computing
0 references
parallel method
0 references
Delaunay tessellation
0 references
convex hull
0 references
convexity
0 references
algorithm
0 references
divide-conquer strategy
0 references