Properties of \(n\)-dimensional triangulations

DOI10.1016/0167-8396(86)90001-4zbMath0624.65018OpenAlexW2046562952MaRDI 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

triangulationDelaunay triangulationDirichlet tesselationsimplicial tesselation of the convex hullsphere test

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of tessellation and tiling problems (05B45) Numerical approximation and computational geometry (primarily algorithms) (65D99)

Related Items

OPTIMAL DELAUNAY POINT INSERTION ⋮ Unnamed Item ⋮ Data point selection for piecewise trilinear approximation ⋮ An \(n\)-dimensional Clough-Tocher interpolant ⋮ Automatic unstructured grid generation based on iterative point insertion ⋮ Incremental topological flipping works for regular triangulations ⋮ Reference dependent invariant sets: sum of squares based computation and applications in constrained control ⋮ Diagonal swap procedures and characterizations of 2D-Delaunay triangulations ⋮ Repairing unstructured triangular mesh intersections ⋮ An optimal multivariate spline method of recovery of twice differentiable functions ⋮ Interior boundary-aligned unstructured grid generation and cell-centered versus vertex-centered CVD-MPFA performance ⋮ The neutral case for the min-max triangulation ⋮ A new approach to output-sensitive construction of Voronoi diagrams and Delaunay triangulations ⋮ Minimum energy triangulations for elliptic problems ⋮ A multivariate Powell-Sabin interpolant ⋮ Delaunay triangulation of arbitrarily shaped planar domains ⋮ Pre-triangulations and liftable complexes ⋮ On dimension and existence of local bases for multivariate spline spaces ⋮ 3D adaptive mesh refinement ⋮ Two condensed macro-elements with full approximation power ⋮ Optimal recovery of twice differentiable functions based on symmetric splines ⋮ Approximating constrained tetrahedrizations ⋮ Two simple algorithms for constructing a two-dimensional constrained Delaunay triangulation ⋮ Adaptive tetrahedral meshing in free-surface flow ⋮ Three-dimensional unstructured gridding for complex wells and geological features in subsurface reservoirs, with CVD-MPFA discretization performance ⋮ Separation by convex pseudo-circles ⋮ A COST/BENEFIT ANALYSIS OF SIMPLICIAL MESH IMPROVEMENT TECHNIQUES AS MEASURED BY SOLUTION EFFICIENCY ⋮ A \(C^1\) multivariate Clough-Tocher interpolant ⋮ Data-dependent triangulations for scattered data interpolation and finite element approximation ⋮ Classification using proximity catch digraphs ⋮ Anisotropic Delaunay Mesh Generation ⋮ Construction of three-dimensional Delaunay triangulations using local transformations

Uses Software

• Algorithm 624
• Algorithm 526
• Algorithm 623

Cites Work

• Three- and four-dimensional surfaces
• A storage-efficient method for construction of a Thiessen triangulation
• A triangle-based \(C^ 1\) interpolation method
• \(C^ 1\) surface interpolation for scattered data on a sphere
• Computing Dirichlet Tessellations in the Plane
• A Method of Bivariate Interpolation and Smooth Surface Fitting for Irregularly Distributed Data Points
• Unnamed Item

This page was built for publication: Properties of \(n\)-dimensional triangulations