Computing optimal triangulations using simulated annealing

DOI10.1016/0167-8396(93)90045-5zbMath0780.65088OpenAlexW2009920752MaRDI QIDQ687467

Larry L. Schumaker

Publication date: 25 October 1993

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8396(93)90045-5

zbMATH Keywords

interpolationcomputer-aided geometric designsimulated annealinglinear splinesglobally optimal triangulations

Mathematics Subject Classification ID

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

Related Items

Surface reconstruction using simplex splines on feature-sensitive configurations ⋮ Automatic unstructured grid generation based on iterative point insertion ⋮ REPAIRING NON-MANIFOLD TRIANGLE MESHES USING SIMULATED ANNEALING ⋮ Metaheuristics: A bibliography ⋮ Characterizing and efficiently computing quadrangulations of planar point sets ⋮ Polyhedral perturbations that preserve topological form ⋮ Rapid prototyping through scanned point data ⋮ Mesh topological optimization for improving piecewise-linear image registration ⋮ Simulated Annealing and Genetic Algorithms in Quest of Optimal Triangulations ⋮ Fitting scattered data on sphere-like surfaces using spherical splines ⋮ On a class of polynomial triangular macro-elements ⋮ Best data-dependent triangulations

Uses Software

• Algorithm 624

Cites Work

• Three- and four-dimensional surfaces
• \(C^ 1\) surface interpolation for scattered data on a sphere
• Transforming triangulations in polygonal domains
• Cubic spline fitting using data dependent triangulations
• Data Dependent Triangulations for Piecewise Linear Interpolation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item