A storage-efficient method for construction of a Thiessen triangulation
From MaRDI portal
Recommendations
Cited in
(15)- Approximation and geometric modeling with simplex B-splines associated with irregular triangles
- Method for finding and storing optimal triangulations based on square matrix
- Properties of n-dimensional triangulations
- Scattered data interpolation based upon generalized minimum norm networks
- Minimal roughness property of the Delaunay triangulation
- Parametrization and smooth approximation of surface triangulations
- Geometrically based, automatic generator for irregular triangular networks
- Derivative generation from multivariate scattered data by functional minimization
- The maximum opposite angulation for mesh construction
- Parallel grid generation/optimization using block-domain decomposition
- The neutral case for the min-max triangulation
- A simple and efficient method for modeling constant mean curvature surfaces
- Preferred directions for resolving the non-uniqueness of Delaunay triangulations
- scientific article; zbMATH DE number 4028826 (Why is no real title available?)
- A data modeling abstraction for describing triangular mesh algorithms
This page was built for publication: A storage-efficient method for construction of a Thiessen triangulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1060525)