@techreport{oai:ipsj.ixsq.nii.ac.jp:00195520,
 author = {樋本, 喬 and 上原, 隆平 and Takashi, Himoto and Ryuhei, Uehara},
 issue = {3},
 month = {May},
 note = {内外相似パズルとは，複数の多角形からなるピース群を配置することで，出来上がった図形の外形と内側に空いた穴が互いに相似な図形にできるかどうかを判定するシルエットパズルの一種である．本稿では，内外相似パズルの困難性についての証明と，制約のある問題を多項式時間で解くアルゴリズムを示す．, Similar Hole Puzzle is one of the silhouette puzzles. Given a set of simple polygons,we decide if they form the silhouette such that the outside shape and its unique hole shape are similar. In this paper, we show that the problem is strongly NP-complete even if the pieces are quite restricted. AIso, we show that the problem can be solved in polynomial time if the number of pieces is a fixed constant.},
 title = {内外相似パズルにおける困難性の証明と効率的なアルゴリズム},
 year = {2019}
}