Computing optimal triangulations using simulated annealing
From MaRDI portal
Publication:687467
DOI10.1016/0167-8396(93)90045-5zbMATH Open0780.65088OpenAlexW2009920752MaRDI QIDQ687467FDOQ687467
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
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
simulated annealinginterpolationcomputer-aided geometric designlinear splinesglobally optimal triangulations
Cites Work
- Title not available (Why is that?)
- Data Dependent Triangulations for Piecewise Linear Interpolation
- \(C^ 1\) surface interpolation for scattered data on a sphere
- Three- and four-dimensional surfaces
- Cubic spline fitting using data dependent triangulations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Transforming triangulations in polygonal domains
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (15)
- Rapid prototyping through scanned point data
- Best data-dependent triangulations
- Polyhedral perturbations that preserve topological form
- Automatic unstructured grid generation based on iterative point insertion
- Mesh topological optimization for improving piecewise-linear image registration
- Fitting scattered data on sphere-like surfaces using spherical splines
- Simplification of closed triangulated surfaces using simulated annealing
- Surface reconstruction using simplex splines on feature-sensitive configurations
- Simulated Annealing and Genetic Algorithms in Quest of Optimal Triangulations
- On a class of polynomial triangular macro-elements
- REPAIRING NON-MANIFOLD TRIANGLE MESHES USING SIMULATED ANNEALING
- Characterizing and efficiently computing quadrangulations of planar point sets
- Metaheuristics: A bibliography
- Title not available (Why is that?)
- Title not available (Why is that?)
Uses Software
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)