Computing optimal triangulations using simulated annealing

DOI10.1016/0167-8396(93)90045-5MaRDI QIDQ687467zbMATH OpenOpenAlexFDO

Authors 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

computer-aided geometric designglobally optimal triangulationsinterpolationlinear splinessimulated annealing

Mathematics Subject Classification ID

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

Review text

The author shows how simulated annealing can be used to search for globally optimal triangulations for a class of optimality criteria. Some examples are given for applications in computer-aided geometric design and data dependent interpolation using linear splines.

Recommendations

• Simulated Annealing and Genetic Algorithms in Quest of Optimal Triangulations
• scientific article; zbMATH DE number 124511
• Area optimal polygonization using simulated annealing
• Simplification of closed triangulated surfaces using simulated annealing
• scientific article; zbMATH DE number 18417
• An optimal algorithm for realizing a Delaunay triangulation
• Efficient suboptimal solutions to the optimal triangulation
• scientific article; zbMATH DE number 49060
• scientific article; zbMATH DE number 2066953
• A New Triangulation for Simplicial Algorithms

Cites work

• \(C^ 1\) surface interpolation for scattered data on a sphere
• Cubic spline fitting using data dependent triangulations
• Data Dependent Triangulations for Piecewise Linear Interpolation
• scientific article; zbMATH DE number 4212690 (Why is no real title available?)
• scientific article; zbMATH DE number 4028826 (Why is no real title available?)
• scientific article; zbMATH DE number 18417 (Why is no real title available?)
• scientific article; zbMATH DE number 19416 (Why is no real title available?)
• scientific article; zbMATH DE number 19420 (Why is no real title available?)
• scientific article; zbMATH DE number 3633698 (Why is no real title available?)
• Three- and four-dimensional surfaces
• Transforming triangulations in polygonal domains

Cited in

(16)

• Characterizing and efficiently computing quadrangulations of planar point sets
• Best data-dependent triangulations
• Fitting scattered data on sphere-like surfaces using spherical splines
• On a class of polynomial triangular macro-elements
• Automatic unstructured grid generation based on iterative point insertion
• Metaheuristics: A bibliography
• Surface reconstruction using simplex splines on feature-sensitive configurations
• Simplification of closed triangulated surfaces using simulated annealing
• Simulated Annealing and Genetic Algorithms in Quest of Optimal Triangulations
• scientific article; zbMATH DE number 18417 (Why is no real title available?)
• scientific article; zbMATH DE number 124511 (Why is no real title available?)
• Rapid prototyping through scanned point data
• REPAIRING NON-MANIFOLD TRIANGLE MESHES USING SIMULATED ANNEALING
• Polyhedral perturbations that preserve topological form
• High quality realtime tessellation of trimmed NURBS surfaces for interactive examination of surface quality on car bodies
• Mesh topological optimization for improving piecewise-linear image registration

Describes a project that uses

Uses Software

• Algorithm 624

This page was built for publication: Computing optimal triangulations using simulated annealing

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