Combining vector quantization and ant-colony algorithm for mesh-partitioning

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present heuristic mesh-partitioning method build on the ant-colony algorithm (ACA) in order to improve the quality of the mesh partitions. The method focuses on improving the initial partition that is submitted to the ACA. The method is experimentally compared with the well-known mesh-partitioning programs pMETIS 4.0 and Chaco 2.0. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Šilc, J., Korošec, P., & Robič, B. (2004). Combining vector quantization and ant-colony algorithm for mesh-partitioning. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3019, 113–118. https://doi.org/10.1007/978-3-540-24669-5_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free