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. © 2004 Springer-Verlag.
Cite
CITATION STYLE
Korošec, P., Šilc, J., & Robič, B. (2004). Mesh-partitioning with the multiple ant-colony algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3172 LNCS, pp. 430–431). Springer Verlag. https://doi.org/10.1007/978-3-540-28646-2_50
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
