Simulated Annealing and Genetic Algorithms in Quest of Optimal Triangulations
From MaRDI portal
Publication:3628371
DOI10.1007/978-3-540-85126-4_11zbMath1184.68565OpenAlexW1525860752MaRDI QIDQ3628371
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global optimization of statistical functions with simulated annealing
- Optimization by Simulated Annealing
- Computing optimal triangulations using simulated annealing
- The relative neighbourhood graph of a finite planar set
- Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
- On nearest-neighbor graphs
- Genetic algorithms for optimized re-triangulation in the context of reverse engineering.
- DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\).
- Regular triangulations of dynamic sets of points
- Anisotropic mesh adaption by metric-driven optimization
- Metric-driven mesh optimization using a local simulated annealing algorithm
- Equation of State Calculations by Fast Computing Machines
- Multicriteria-optimized triangulations
This page was built for publication: Simulated Annealing and Genetic Algorithms in Quest of Optimal Triangulations
