Convex configurations on Nana-kin-san puzzle

DOI10.4230/LIPICS.FUN.2016.20zbMATH Open1369.68342OpenAlexW2472167599MaRDI QIDQ5282818FDOQ5282818

Authors: Takashi Horiyama, Ryuhei Uehara, Haruo Hosoya 

Publication date: 17 July 2017

Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.FUN.2016.20

Recommendations

• The complete characterization of tangram pentagons
• scientific article; zbMATH DE number 2059941
• Wooden Geometric Puzzles: Design and Hardness Proofs
• Publication:4940980
• Symmetric assembly puzzles are hard, beyond a few pieces

zbMATH Keywords

convex polygonenumeration algorithmNana-kin-san puzzlesilhouette puzzles

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (2)

• The complete characterization of tangram pentagons
• Title not available (Why is that?)

This page was built for publication: Convex configurations on Nana-kin-san puzzle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5282818)