Algorithm for Delaunay triangulation and convex-hull computation using a sparse matrix
Authors:
- T-P. FangTFT-P. Fang
- L.A. PieglLPL.A. Piegl
- 1 August 1992
- journal article
- Published by Elsevier in Computer-Aided Design
- Vol. 24 (8) , 425-436
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- Computational Geometry—A SurveyIEEE Transactions on Computers, 1984
- A storage-efficient method for construction of a Thiessen triangulationRocky Mountain Journal of Mathematics, 1984
- Computing Dirichlet tessellationsThe Computer Journal, 1981
- Two algorithms for constructing a Delaunay triangulationInternational Journal of Parallel Programming, 1980
- Computing Dirichlet Tessellations in the PlaneThe Computer Journal, 1978
- Triangulation of planar regions with applicationsThe Computer Journal, 1978
- Locally equiangular triangulationsThe Computer Journal, 1978
- Analytic Delineation of Thiessen Polygons*Geographical Analysis, 1973