A storage-efficient method for construction of a Thiessen triangulation

DOI10.1216/RMJ-1984-14-1-119zbMath0568.65005OpenAlexW2142619821MaRDI QIDQ1060525

A. K. Cline, R. L. Renka

Publication date: 1984

Published in: Rocky Mountain Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1216/rmj-1984-14-1-119

zbMATH Keywords

data structurestriangulatingpresortingThiessen tesselationVoroni

Mathematics Subject Classification ID

Numerical interpolation (65D05) Multidimensional problems (41A63) Interpolation in approximation theory (41A05)

Related Items (13)

Parallel grid generation/optimization using block-domain decomposition ⋮ A Simple and Efficient Method for Modeling Constant Mean Curvature Surfaces ⋮ Parametrization and smooth approximation of surface triangulations ⋮ The neutral case for the min-max triangulation ⋮ A data modeling abstraction for describing triangular mesh algorithms ⋮ Preferred directions for resolving the non-uniqueness of Delaunay triangulations ⋮ The maximum opposite angulation for mesh construction ⋮ Properties of \(n\)-dimensional triangulations ⋮ Scattered data interpolation based upon generalized minimum norm networks ⋮ Minimal roughness property of the Delaunay triangulation ⋮ Approximation and geometric modeling with simplex B-splines associated with irregular triangles ⋮ Geometrically based, automatic generator for irregular triangular networks ⋮ Derivative generation from multivariate scattered data by functional minimization

This page was built for publication: A storage-efficient method for construction of a Thiessen triangulation