Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix
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.
scientific article; zbMATH DE number 69295