Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix
type: Item
instance of: scholarly article
title: Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix
zbMATH Open document ID: 0756.65167
DOI: 10.1016/0010-4485(92)90010-8
author: S. Singh
published in: CAD. Computer-Aided Design
publication date: 1992-10-21T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65D18
zbMATH DE Number: 69295
zbMATH Keywords: circular-triangulation strategy
zbMATH Keywords: shelling
zbMATH Keywords: computational geometry
zbMATH Keywords: Delaunay triangulation
zbMATH Keywords: convex hull
zbMATH Keywords: algorithm
reviewed by: Heinrich Guggenheimer
MaRDI profile type: Publication
full work available at URL: 0010-4485(92)90010-8
OpenAlex ID: W2048528416
description: scientific article; zbMATH DE number 69295