Advanced Search
Zhang Kai, Ke Ying, Cao Juan, Chen Zhonggui. Circle Group Packing Algorithm for Mosaic Synthesis[J]. Journal of Computer-Aided Design & Computer Graphics, 2018, 30(7): 1216-1223. DOI: 10.3724/SP.J.1089.2018.16767
Citation: Zhang Kai, Ke Ying, Cao Juan, Chen Zhonggui. Circle Group Packing Algorithm for Mosaic Synthesis[J]. Journal of Computer-Aided Design & Computer Graphics, 2018, 30(7): 1216-1223. DOI: 10.3724/SP.J.1089.2018.16767

Circle Group Packing Algorithm for Mosaic Synthesis

  • To produce the mosaic patterns with compact arrangements of irregular tiles, this paper proposes a flexible method for mosaic synthesis, which is based on a circle group packing algorithm. First, we create a group of circles to approximate the contour of each tiles, resorting to its straight skeleton. Next, the power diagram is generated by setting the weight of each site as each circle's squared radius, and each circle group has its corresponding power region. Finally, all circle groups are magnified in their power regions by a relaxation method. By generating the power diagram and magnifying the circle groups iteratively, we get a compact packing of the tiles. The experiment results show that, our method is able to generate mosaic patterns with high coverages and arbitrary tile shapes, and it has good robustness and flexibility.
  • loading

Catalog

    Turn off MathJax
    Article Contents

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return