Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix (Q1195312)
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: Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix |
scientific article; zbMATH DE number 69295
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix |
scientific article; zbMATH DE number 69295 |
Statements
Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix (English)
0 references
21 October 1992
0 references
The authors define a data structure represented by a matrix for a set of points in the plane that, once computed, allows the fast implementation of an algorithm producing the Delaunay triangulation of the given set. The algorithm can be modified to compute the convex hull concurrently. The paper is concerned with a detailed exposition of the algorithm and its formulation in pseudocode. The only mathematics in it is the proof that the algorithm really delivers a Delaunay triangulation.
0 references
circular-triangulation strategy
0 references
shelling
0 references
computational geometry
0 references
Delaunay triangulation
0 references
convex hull
0 references
algorithm
0 references
