Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix

DOI10.1016/0010-4485(92)90010-8zbMath0756.65167OpenAlexW2048528416MaRDI QIDQ1195312

S. Singh

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

zbMATH Keywords

algorithmconvex hullcomputational geometryDelaunay triangulationshellingcircular-triangulation strategy

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (4)

A simple unstructured tetrahedral mesh generation algorithm for complex geometries ⋮ \(C^{1}\) positivity preserving scattered data interpolation using rational Bernstein-Bézier triangular patch ⋮ Rapid prototyping through scanned point data ⋮ \(C^{1}\) positive scattered data interpolation

This page was built for publication: Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix