Efficient Segment Folding is Hard

12/21/2020
by   Takashi Horiyama, et al.
0

We introduce a computational origami problem which we call the segment folding problem: given a set of n line-segments in the plane the aim is to make creases along all segments in the minimum number of folding steps. Note that a folding might alter the relative position between the segments, and a segment could split into two. We show that it is NP-hard to determine whether n line segments can be folded in n simple folding operations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/30/2019

Constrained Orthogonal Segment Stabbing

Let S and D each be a set of orthogonal line segments in the plane. A li...
research
03/17/2023

Connectivity with uncertainty regions given as line segments

For a set Q of points in the plane and a real number δ≥ 0, let 𝔾_δ(Q) be...
research
07/11/2019

Simplification of Polyline Bundles

We propose and study generalizations to the well-known problem of polyli...
research
05/20/2018

Hardness of CONTIGUOUS SAT and Visibility with Uncertain Obstacles

Consider SAT with the following restrictions. An input formula is in CNF...
research
12/02/2022

Stabbing balls with line segments and polygonal paths

We study the problem of ordered stabbing of n balls (of arbitrary and po...
research
04/25/2013

Euclidean Upgrade from a Minimal Number of Segments

In this paper, we propose an algebraic approach to upgrade a projective ...
research
08/02/2017

Line Segment Covering of Cells in Arrangements

Given a collection L of line segments, we consider its arrangement and s...

Please sign up or login with your details

Forgot password? Click here to reset