Minimal roughness property of the Delaunay triangulation
From MaRDI portal
Publication:751165
DOI10.1016/0167-8396(90)90011-FzbMath0714.65009OpenAlexW2085550119MaRDI QIDQ751165
Publication date: 1990
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8396(90)90011-f
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical interpolation (65D05)
Related Items
Edge insertion for optimal triangulations, Extremum problems for eigenvalues of discrete Laplace operators, Non-simplicial Delaunay meshing via approximation by radical partitions, Ideal hyperbolic polyhedra and discrete uniformization, Determinant of the finite volume Laplacian, A spectral characterization of the Delaunay triangulation, Why Do We Need Voronoi Cells and Delaunay Meshes?, A fully optimal anisotropic mesh adaptation method based on a hierarchical error estimator, Why do we need Voronoi cells and Delaunay meshes? Essential properties of the Voronoi finite volume method, A Note on Cheeger Inequalities for Piecewise Flat Surfaces, Efficient mesh optimization schemes based on optimal Delaunay triangulations, Minimum energy triangulations for elliptic problems, Vertex based data dependent triangulations, An algorithm for the construction of intrinsic Delaunay triangulations with applications to digital geometry processing, Flips in planar graphs, A discrete Laplace-Beltrami operator for simplicial surfaces, A monotonicity property for weighted Delaunay triangulations, Minimal roughness property of the Delaunay triangulation: A shorter approach, An upper bound for conforming Delaunay triangulations, General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties, Kernel interpolation, Curvature and Flow in Digital Space, The Voronoi functional is maximized by the Delaunay triangulation in the plane, Data-dependent triangulations for scattered data interpolation and finite element approximation, Interpolation error estimates for harmonic coordinates on polytopes, \(r\)-regular shape reconstruction from unorganized points, Terrain simplification by minimization of the local deformation
Cites Work
- Unnamed Item
- A storage-efficient method for construction of a Thiessen triangulation
- A faster divide-and-conquer algorithm for constructing Delaunay triangulations
- Transforming triangulations
- Delaunay-based representation of surfaces defined over arbitrarily shaped domains
- Data Dependent Triangulations for Piecewise Linear Interpolation
- Two algorithms for constructing a Delaunay triangulation
- Triangular Elements in the Finite Element Method
