An O(log n) time parallel algorithm for triangulating a set of points in the plane (Q1107999)
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: An O(log n) time parallel algorithm for triangulating a set of points in the plane |
scientific article; zbMATH DE number 4066325
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(log n) time parallel algorithm for triangulating a set of points in the plane |
scientific article; zbMATH DE number 4066325 |
Statements
An O(log n) time parallel algorithm for triangulating a set of points in the plane (English)
0 references
1987
0 references
parallel algorithm
0 references
computational geometry
0 references
triangulation of point sets
0 references
