An algorithm for the construction of intrinsic Delaunay triangulations with applications to digital geometry processing

DOI10.1007/s00607-007-0249-8zbMath1149.65014OpenAlexW2084533748MaRDI QIDQ946479

B. E. Eshmatov

Publication date: 23 September 2008

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-007-0249-8

zbMATH Keywords

numerical examplescomputational geometrygraphical examples

Mathematics Subject Classification ID

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

Related Items (6)

Delaunay triangulations of closed Euclidean \(d\)-orbifolds ⋮ Discrete Conformal Deformation: Algorithm and Experiments ⋮ Discrete Exterior Calculus (DEC) for the Surface Navier-Stokes Equation ⋮ Growing Self-Organizing Surface Map: Learning a Surface Topology from a Point Cloud ⋮ Weighted Triangulations for Geometry Processing ⋮ Isogeometric analysis-suitable trivariate NURBS models from standard B-Rep models

Cites Work

• Minimal roughness property of the Delaunay triangulation
• A discrete Laplace-Beltrami operator for simplicial surfaces
• Computing Discrete Minimal Surfaces and Their Conjugates
• Discrete Riemann surfaces and the Ising model.
• Voronoi diagrams on piecewise flat surfaces and an application to biological growth
• Unnamed Item

This page was built for publication: An algorithm for the construction of intrinsic Delaunay triangulations with applications to digital geometry processing