Minimum Forcing Sets for Single-vertex Crease Pattern

• Ouchi Koji

  TIMEINTERMEDIA, Inc.

• Uehara Ryuhei

  Japan Advanced Institute of Science and Technology

Abstract

We propose an algorithm for finding a minimum forcing set of a given flat-foldable single-vertex crease pattern (SVCP). SVCP consists of straight lines called creases that can be labeled as mountains or valleys, and the creases are incident to the center of a disk of paper. A forcing set is a subset of given creases that forces all other creases to fold according to the given labels. Our algorithm is a modification of an existing algorithm for 1D origami. We show that the size of a minimum forcing set of an SVCP is n/2 or n/2+1 where n is the number of creases in the SVCP.

Journal

• Journal of Information Processing

  Journal of Information Processing 28 (0), 800-805, 2020

  Information Processing Society of Japan

Keywords

• computational origami
• single-vertex crease pattern
• forcing set
• flat-foldability

Details

• CRID: 1391412881266731392
• NII Article ID: 130007956331
• DOI: 10.2197/ipsjjip.28.800
• ISSN: 18826652
• Web Site: https://www.jstage.jst.go.jp/article/ipsjjip/28/0/28_800/_pdf
• Text Lang: en
• Data Source:
  • JaLC
  • Crossref
  • CiNii Articles
  • KAKEN
• Abstract License Flag: Disallowed