A storage-efficient method for construction of a Thiessen triangulation
The paper addresses the problem of triangulating a set of two-dimensional data points. Among the many possible triangulations, the one arising from the Thiessen (or Voroni or Dirichlet) tesselation of the data points has several desirable properties. The described method does not construct the Thiessen tesselation but builds the triangulation by optimizing an initial triangulation (swapping of diagonals). A presorting of the data points is carried out which, in connection with the described data structure, proves to be time efficient. The algorithm and the used data structure are then compared to other methods.
- Derivative generation from multivariate scattered data by functional minimization
- Parametrization and smooth approximation of surface triangulations
- The maximum opposite angulation for mesh construction
- Scattered data interpolation based upon generalized minimum norm networks
- Preferred directions for resolving the non-uniqueness of Delaunay triangulations
- A simple and efficient method for modeling constant mean curvature surfaces
- Geometrically based, automatic generator for irregular triangular networks
- scientific article; zbMATH DE number 4028826 (Why is no real title available?)
- Parallel grid generation/optimization using block-domain decomposition
- Method for finding and storing optimal triangulations based on square matrix
- Properties of n-dimensional triangulations
- A data modeling abstraction for describing triangular mesh algorithms
- Minimal roughness property of the Delaunay triangulation
- Approximation and geometric modeling with simplex B-splines associated with irregular triangles
- The neutral case for the min-max triangulation
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)
