Conference PaperFolding points to a point and lines to a lineAkitaya, Hugo A.; Ballinger, Brad; Demaine, Erik D.; Hull, Thomas C.; Schmidt, ChristianeHe, Meng; Sheehy, DonWe 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 L that connects two boundary points of P and compute the number of edges of the polygon containing p or L limited by crease lines and boundary edges.2021-08-1010285207Proceedings of the 33rd Canadian Conference on Computational Geometry (CCCG 2021)271-278https://doi.org/1906202; 2428771National Science Foundation