Format

Send to

Choose Destination
See comment in PubMed Commons below
IEEE Trans Vis Comput Graph. 2010 Mar-Apr;16(2):298-311. doi: 10.1109/TVCG.2009.67.

Origamizing polyhedral surfaces.

Author information

1
The University of Tokyo, Tokyo, Japan. ttachi@siggraph.org

Abstract

This paper presents the first practical method for "origamizing" or obtaining the folding pattern that folds a single sheet of material into a given polyhedral surface without any cut. The basic idea is to tuck fold a planar paper to form a three-dimensional shape. The main contribution is to solve the inverse problem; the input is an arbitrary polyhedral surface and the output is the folding pattern. Our approach is to convert this problem into a problem of laying out the polygons of the surface on a planar paper by introducing the concept of tucking molecules. We investigate the equality and inequality conditions required for constructing a valid crease pattern. We propose an algorithm based on two-step mapping and edge splitting to solve these conditions. The two-step mapping precalculates linear equalities and separates them from other conditions. This allows an interactive manipulation of the crease pattern in the system implementation. We present the first system for designing three-dimensional origami, enabling a user can interactively design complex spatial origami models that have not been realizable thus far.

PMID:
20075489
DOI:
10.1109/TVCG.2009.67
[Indexed for MEDLINE]
PubMed Commons home

PubMed Commons

0 comments
How to join PubMed Commons

    Supplemental Content

    Full text links

    Icon for IEEE Engineering in Medicine and Biology Society
    Loading ...
    Support Center