Optimal triangulation by means of evolutionary algorithms
Author(s) -
G. Prestifilippo
Publication year - 1997
Publication title -
citeseer x (the pennsylvania state university)
Language(s) - English
Resource type - Conference proceedings
ISSN - 0537-9989
ISBN - 0-85296-693-8
DOI - 10.1049/cp:19971229
Subject(s) - triangulation , computer science , algorithm , evolutionary algorithm , artificial intelligence , mathematics , geometry
The comparison in the paper shows that the evolutionary algorithm (EA) triangulation is superior to traditional deterministic algorithms, and that the EA is at least an alternative to simulated annealing (SA). Although SA produces results of the same quality in shorter time, the EA may be preferable for large problem instances due to the existence of efficient parallel implementations. From a more general view, the SA and EA are probabilistic search methods which could be easily modeled in a common framework. The successful application of EAs to surface reconstruction presented here can be seen as a first feasibility study. It is very likely that both the performance of the algorithm and the quality of the results can be further improved by advanced operators, such as recombination and self-adaptive mutation rates
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom