Simulated Annealing and Genetic Algorithms in Quest of Optimal Triangulations

DOI10.1007/978-3-540-85126-4_11MaRDI QIDQ3628371zbMATH OpenOpenAlexFDO

Authors Ivana Kolingerová

Publication date 20 May 2009

Published in Generalized Voronoi Diagram: A Geometry-Based Approach to Computational Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85126-4_11

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Computing optimal triangulations using simulated annealing
• Multicriteria-optimized triangulations
• scientific article; zbMATH DE number 18417
• scientific article; zbMATH DE number 906536
• scientific article; zbMATH DE number 124511

Cites work

• Anisotropic mesh adaption by metric-driven optimization
• Computing optimal triangulations using simulated annealing
• Delaunay triangulation based surface reconstruction
• DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\).
• Equation of state calculations by fast computing machines
• Genetic algorithms for optimized re-triangulation in the context of reverse engineering.
• Global optimization of statistical functions with simulated annealing
• scientific article; zbMATH DE number 2040780 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 867338 (Why is no real title available?)
• Metric-driven mesh optimization using a local simulated annealing algorithm
• Minimum weight triangulation is NP-hard
• Multicriteria-optimized triangulations
• Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
• On nearest-neighbor graphs
• Optimization by simulated annealing
• Regular triangulations of dynamic sets of points
• Simplification of closed triangulated surfaces using simulated annealing
• The relative neighbourhood graph of a finite planar set
• Using Genetic Algorithms in Computer Vision: Registering Images to 3D Surface Model

Cited in

(9)

• Optimal tetrahedral mesh generation for three-dimensional point set
• Sequential Triangle Strip Generator Based on Hopfield Networks
• scientific article; zbMATH DE number 18417 (Why is no real title available?)
• scientific article; zbMATH DE number 124511 (Why is no real title available?)
• REPAIRING NON-MANIFOLD TRIANGLE MESHES USING SIMULATED ANNEALING
• scientific article; zbMATH DE number 906536 (Why is no real title available?)
• scientific article; zbMATH DE number 5269238 (Why is no real title available?)
• Multicriteria-optimized triangulations
• Computing optimal triangulations using simulated annealing

This page was built for publication: Simulated Annealing and Genetic Algorithms in Quest of Optimal Triangulations

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