@book{776b504da9b04bfe9e6e36a4b4682b4d,
title = "Determining the essentially different partitions of all Japanese convex tangrams",
abstract = "In this report we consider the set of the 16 possible convex tangrams that can be composed with the 7 so-called {\textquotedblleft}Sei Shonagon Chie no Ita{\textquotedblright} (or Japanese) tans, see [9]. The set of these Japanese tans is slightly different from the well-known set of 7 Chinese tans with which 13 (out of those 16) convex tangrams can be formed. In [4], [5] the problem of determining all essentially different partitions of the 13 {\textquotedblleft}Chinese{\textquotedblright} convex tangrams was investigated and solved. In this report we will address the same problem for the {\textquotedblleft}Japanese{\textquotedblright} convex tangrams. The approach to solve both problems is more or less analogous, but the {\textquotedblleft}Japanese{\textquotedblright} problem is much harder than the {\textquotedblleft}Chinese{\textquotedblright} one, since the number of {\textquotedblleft}Japanese{\textquotedblright} solutions is much larger than the {\textquotedblleft}Chinese{\textquotedblright} ones. In fact, only for a few {\textquotedblleft}Japanese{\textquotedblright} tangram shapes their solutions can be found by a rigorous analysis supported by a large number of clarifying diagrams. The solutions for the remaining shapes have to be determined using a dedicated computer program. Both approaches will be discussed here and all essentially different solutions with the {\textquotedblleft}Japanese{\textquotedblright} tans are presented. As far as we know all presented results are not yet published before.",
keywords = "tangram, partition, backtracking, visualization",
author = "T.G.J. Beelen and T. Verhoeff",
year = "2018",
month = nov,
language = "English",
volume = "18",
series = "CASA report",
publisher = "Technische Universiteit Eindhoven",
edition = "07",
}