Paper by Erik D. Demaine

Reference:

Hugo A. Akitaya, Brad Ballinger, Erik D. Demaine, Thomas C. Hull, and Christiane Schmidt, “Folding Points to a Point and Lines to a Line”, in Proceedings of the 33rd Canadian Conference in Computational Geometry (CCCG 2021), Halifax, Nova Scotia, Canada, August 10–12, 2021, pages 271–278.

BibTeX

@InProceedings{Haga_CCCG2021,
  AUTHOR        = {Hugo A. Akitaya and Brad Ballinger and Erik D. Demaine and Thomas C. Hull and Christiane Schmidt},
  TITLE         = {Folding Points to a Point and Lines to a Line},
  BOOKTITLE     = {Proceedings of the 33rd Canadian Conference in Computational Geometry (CCCG 2021)},
  bookurl       = {https://projects.cs.dal.ca/cccg2021/},
  ADDRESS       = {Halifax, Nova Scotia, Canada},
  MONTH         = {August 10--12},
  YEAR          = 2021,
  PAGES         = {271--278},

  unrefereed    = 1,
  dblp          = {https://dblp.org/rec/conf/cccg/AkitayaBDH021},
  comments      = {This paper is also available from the <A HREF="https://projects.cs.dal.ca/cccg2021/wordpress/wp-content/uploads/2021/08/CCCG2021.pdf#page=281">electronic proceedings</A>.},
}

Abstract:

We introduce basic, but heretofore generally unexplored, problems in computational origami that are similar in style to classic problems from discrete and computational geometry.

We consider the problems of folding each corner of a polygon P to a point p and folding each edge of a polygon P onto a line segment ℓ that connects two boundary points of P and compute the number of edges of the polygon containing p or ℓ limited by crease lines and boundary edges.

Comments:

This paper is also available from the electronic proceedings.

Availability:

The paper is available in PDF (808k).

See information on file formats.

[Google Scholar search]