Minimal roughness property of the Delaunay triangulation

DOI10.1016/0167-8396(90)90011-FMaRDI QIDQ751165zbMATH OpenOpenAlexFDO

Authors Samuel Rippa

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

zbMATH Keywords

Delaunay triangulationscattered dataroughness measurepiecewise linear interpolating surface

Mathematics Subject Classification ID

Numerical interpolation (65D05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Minimal roughness property of the Delaunay triangulation: A shorter approach
• Vertex based data dependent triangulations
• The Delaunay triangulation for multidimensional surfaces and its approximative properties
• scientific article; zbMATH DE number 2066953
• Best data-dependent triangulations

Cites work

• scientific article; zbMATH DE number 3633698 (Why is no real title available?)
• A faster divide-and-conquer algorithm for constructing Delaunay triangulations
• A storage-efficient method for construction of a Thiessen triangulation
• Data Dependent Triangulations for Piecewise Linear Interpolation
• Delaunay-based representation of surfaces defined over arbitrarily shaped domains
• Transforming triangulations
• Triangular Elements in the Finite Element Method
• Two algorithms for constructing a Delaunay triangulation

Cited in

(31)

• A monotonicity property for weighted Delaunay triangulations
• Geometric triangulations and discrete Laplacians on manifolds: an update
• General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties
• Scattered data interpolation using minimum energy Powell-Sabin elements and data dependent triangulations
• A fully optimal anisotropic mesh adaptation method based on a hierarchical error estimator
• The Voronoi functional is maximized by the Delaunay triangulation in the plane
• Interpolation error estimates for harmonic coordinates on polytopes
• The Delaunay triangulation for multidimensional surfaces and its approximative properties
• Terrain simplification by minimization of the local deformation
• \(r\)-regular shape reconstruction from unorganized points
• Edge insertion for optimal triangulations
• An upper bound for conforming Delaunay triangulations
• Kernel interpolation
• Non-simplicial Delaunay meshing via approximation by radical partitions
• An algorithm for the construction of intrinsic Delaunay triangulations with applications to digital geometry processing
• Ideal hyperbolic polyhedra and discrete uniformization
• A spectral characterization of the Delaunay triangulation
• Why do we need Voronoi cells and Delaunay meshes?
• Extremum problems for eigenvalues of discrete Laplace operators
• Data-dependent triangulations for scattered data interpolation and finite element approximation
• 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
• Minimal roughness property of the Delaunay triangulation: A shorter approach
• Determinant of the finite volume Laplacian
• Order-2 Delaunay triangulations optimize angles
• A discrete Laplace-Beltrami operator for simplicial surfaces
• Curvature and flow in digital space
• Flips in planar graphs
• Minimum energy triangulations for elliptic problems
• Vertex based data dependent triangulations

This page was built for publication: Minimal roughness property of the Delaunay triangulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751165)