Properties of n-dimensional triangulations
- 31 December 1986
- journal article
- Published by Elsevier BV in Computer Aided Geometric Design
- Vol. 3 (4), 231-246
- https://doi.org/10.1016/0167-8396(86)90001-4
Abstract
This paper establishes a number of mathematical results relevant to the problem of constructing a triangulation, i.e., a simplical tessellation of the convex hull of an arbitrary finite set of points in n-space.Keywords
This publication has 9 references indexed in Scilit:
- Interpolation of data on the surface of a sphereACM Transactions on Mathematical Software, 1984
- Algorithm 624: Triangulation and Interpolation at Arbitrarily Distributed Points in the PlaneACM Transactions on Mathematical Software, 1984
- $C^1$ surface interpolation for scattered data on a sphereRocky Mountain Journal of Mathematics, 1984
- Three- and four-dimensional surfacesRocky Mountain Journal of Mathematics, 1984
- A storage-efficient method for construction of a Thiessen triangulationRocky Mountain Journal of Mathematics, 1984
- Computing Dirichlet tessellationsThe Computer Journal, 1981
- A Method of Bivariate Interpolation and Smooth Surface Fitting for Irregularly Distributed Data PointsACM Transactions on Mathematical Software, 1978
- Computing Dirichlet Tessellations in the PlaneThe Computer Journal, 1978
- Locally equiangular triangulationsThe Computer Journal, 1978