Mesh-partitioning with the multiple ant-colony algorithm
Authors
P. Korošec, J. Šilc, B. Robič
Publication
Lecture Notes in Computer Science, 2004, 3172: 430-431
Abstract
We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The first method augments the multiple ant-colony algorithm with a multilevel paradigm, whereas the second uses the multiple ant-colony algorithm as a refinement to the initial partition obtained by vector quantization. The two methods are experimentally compared with the well-known mesh-partitioning programs.
BIBTEX copied to Clipboard