Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix
From MaRDI portal
Publication:1195312
DOI10.1016/0010-4485(92)90010-8zbMath0756.65167MaRDI QIDQ1195312
Publication date: 21 October 1992
Published in: CAD. Computer-Aided Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0010-4485(92)90010-8
algorithm; convex hull; computational geometry; Delaunay triangulation; shelling; circular-triangulation strategy
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry