An ω(√n) lower bound for the nonoptimality of the greedy triangulation
Information Processing Letters
A heuristic triangulation algorithm
Journal of Algorithms
Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images
Readings in computer vision: issues, problems, principles, and paradigms
Near-optimal triangulation of a point set by simulated annealing
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Computing a subgraph of the minimum weight triangulation
Computational Geometry: Theory and Applications
Approaching the largest &bgr;-skeleton within a minimum weight triangulation
Proceedings of the twelfth annual symposium on Computational geometry
Pseudo-triangulations: theory and applications
Proceedings of the twelfth annual symposium on Computational geometry
Implementations of the LMT heuristic for minimum weight triangulation
Proceedings of the fourteenth annual symposium on Computational geometry
Quasi-greedy triangulations approximating the minimum weight triangulation
Journal of Algorithms
Information Processing Letters
A weight-coded genetic algorithm for the minimum weight triangulation problem
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Swarm intelligence
Meta-Heuristics: Theory and Applications
Meta-Heuristics: Theory and Applications
Handbook of Evolutionary Computation
Handbook of Evolutionary Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
Ant Colony Optimization
How to Solve It: Modern Heuristics
How to Solve It: Modern Heuristics
A quasi-polynomial time approximation scheme for minimum weight triangulation
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Minimum weight triangulation is NP-hard
Proceedings of the twenty-second annual symposium on Computational geometry
Experimental Research in Evolutionary Computation: The New Experimentalism (Natural Computing Series)
Design and Modeling for Computer Experiments (Computer Science & Data Analysis)
Design and Modeling for Computer Experiments (Computer Science & Data Analysis)
Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
SIAM Journal on Computing
Minimum weight pseudo-triangulations
Computational Geometry: Theory and Applications
SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
On triangulations of a set of points in the plane
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
On constrained minimum pseudotriangulations
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Very fast simulated re-annealing
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
Globally optimal triangulations and pseudo-triangulations are difficult to be found by deterministic methods as, for most type of criteria, no polynomial algorithm is known. In this work, we consider the Minimum Weight Triangulation (MWT) and Minimum Weight Pseudo-Triangulation (MWPT) problems of a given set of n points in the plane. This paper shows how the Ant Colony Optimization (ACO) metaheuristic can be used to find high quality triangulations and pseudo-triangulations of minimum weight. For the experimental study presented here we have created a set of instances for MWT and MWPT problems since no reference to benchmarks for these problems were found in the literature. Through the experimental evaluation, we assess the applicability of the ACO metaheuristic for MWT and MWPT problems considering greedy and Simulated Annealing algorithms.