Properties of \(n\)-dimensional triangulations

DOI10.1016/0167-8396(86)90001-4zbMath0624.65018MaRDI QIDQ578840

Charles L. Lawson

Publication date: 1986

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8396(86)90001-4

zbMATH Keywords

triangulation; Delaunay triangulation; Dirichlet tesselation; simplicial tesselation of the convex hull; sphere test

Mathematics Subject Classification ID

52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)

05B45: Combinatorial aspects of tessellation and tiling problems

65D99: Numerical approximation and computational geometry (primarily algorithms)

Related Items

Unnamed Item, Minimum energy triangulations for elliptic problems, Delaunay triangulation of arbitrarily shaped planar domains, On dimension and existence of local bases for multivariate spline spaces, Approximating constrained tetrahedrizations, Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation, Data point selection for piecewise trilinear approximation, Data-dependent triangulations for scattered data interpolation and finite element approximation, Automatic unstructured grid generation based on iterative point insertion, Incremental topological flipping works for regular triangulations, Unnamed Item, Unnamed Item

Uses Software

• Algorithm 624
• Algorithm 526
• Algorithm 623