Access this Article

Abstract

We prove NP-completeness of deciding whether a given loop of colored right isosceles triangles, hinged together at edges, can be folded into a specified rectangular three-color pattern. By contrast, the same problem becomes polynomially solvable with one color or when the target shape is a tree-shaped polyomino.March 17-20, 2013, Braunschweig, Germany

Journal

  • The 29th European Workshop on Computational Geometry (EuroCG 2013)

    The 29th European Workshop on Computational Geometry (EuroCG 2013), 147-150, 2013-03

Codes

  • NII Article ID (NAID)
    120006675376
  • Text Lang
    ENG
  • Article Type
    conference paper
  • Data Source
    IR 
Page Top