Why is the 3D Delaunay triangulation difficult to construct?
type: Item
instance of: scholarly article
title: Why is the 3D Delaunay triangulation difficult to construct?
zbMATH Open document ID: 1004.68556
DOI: 10.1016/0020-0190(95)00028-B
author: Hiroshi Inagaki
author: K. Sugihara
published in: Information Processing Letters
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 985322
zbMATH Keywords: Delaunay triangulation
zbMATH Keywords: degeneracy
zbMATH Keywords: numerical robustness
zbMATH Keywords: topological consistency
MaRDI profile type: Publication
cites work: Q3772828
cites work: An acyclicity theorem for cell complexes in d dimensions
cites work: Axioms and hulls
cites work: Two algorithms for constructing a Delaunay triangulation
cites work: Verifiable implementations of geometric algorithms using finite precision arithmetic
cites work: Q4361347
cites work: IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
cites work: Q3992847
cites work: Q4003998
cites work: Q4008399
cites work: A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
full work available at URL: 0020-0190(95)00028-b
OpenAlex ID: W2058714019
description: scientific article; zbMATH DE number 985322