Orthogonal Fold & Cut

Dylan Hendrickson; Erik D. Demaine; Hayashi Ani; Josh Brunner; Martin L. Demaine; Rachana Madhukara; Victor Luo

REVIEW

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2202.01293 v2 pith:FRUMCPD7 submitted 2022-02-02 cs.CG math.MG

Orthogonal Fold & Cut

Hayashi Ani , Josh Brunner , Erik D. Demaine , Martin L. Demaine , Dylan Hendrickson , Victor Luo , Rachana Madhukara This is my paper

classification cs.CG math.MG

keywords foldorthogonalalongangleaxis-alignedcharacterizecreasesfolding

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

We characterize the cut patterns that can be produced by "orthogonal fold & cut": folding an axis-aligned rectangular sheet of paper along horizontal and vertical creases, and then making a single straight cut (at any angle). Along the way, we solve a handful of related problems: orthogonal fold & punch, 1D fold & cut, signed 1D fold & cut, and 1D interval fold & cut.

Orthogonal Fold & Cut

discussion (0)