English
Related papers

Related papers: Rigid Foldability is NP-Hard

200 papers

A general force-perturbation-based criterion for solid instability is proposed, which can predict instability including crease without priori knowledge of instability configuration. The crease instability is analyzed in detail, we found…

Soft Condensed Matter · Physics 2020-01-01 Pengfei Yang , Yaopeng Fang , Yanan Yuan , Shun Meng , Haroon Imtiaz , Bin Liu , Huajian Gao

The principles of origami design have proven useful in a number of technological applications. Origami tessellations in particular constitute a class of morphing metamaterials with unusual geometric and elastic properties. Although…

Soft Condensed Matter · Physics 2022-07-19 Hussein Nassar , Arthur Lebée , Emily Werner

Three-dimensional shells can be synthesized from the spontaneous self-folding of two-dimensional templates of interconnected panels, called nets. However, some nets are more likely to self-fold into the desired shell under random movements.…

Data Structures and Algorithms · Computer Science 2018-07-10 N. A. M. Araújo , R. A. da Costa , S. N. Dorogovtsev , J. F. F. Mendes

Optimization problems consist of either maximizing or minimizing an objective function. Instead of looking for a maximum solution (resp. minimum solution), one can find a minimum maximal solution (resp. maximum minimal solution). Such…

Data Structures and Algorithms · Computer Science 2018-11-08 Kaveh Khoshkhah , Mehdi Khosravian Ghadikolaei , Jerome Monnot , Florian Sikora

We study, experimentally and theoretically, the mechanical response of sheet materials on which line cracks or cuts are arranged in a simple pattern. Such sheet materials, often called kirigami (the Japanese words, kiri and gami, stand for…

Soft Condensed Matter · Physics 2016-09-01 Midori Isobe , Ko Okumura

We give an elementary proof of a somewhat curious result, namely, that deciding whether a convex function is self-concordant is in general an intractable problem.

Optimization and Control · Mathematics 2013-04-01 Lek-Heng Lim

We present an additive approach for the inverse design of kirigami-based mechanical metamaterials by focusing on the empty (negative) spaces instead of the solid tiles. By considering each negative space as a four-bar linkage, we identify a…

Soft Condensed Matter · Physics 2023-05-29 Levi H. Dudte , Gary P. T. Choi , Kaitlyn P. Becker , L. Mahadevan

For any even natural number $r \ge 2$, we construct an irreducible rigid non-cohomologically rigid complex local system of rank $r$ on a smooth projective variety depending on $r$. For $r=2$, we construct an irreducible rigid…

Algebraic Geometry · Mathematics 2022-08-30 Johan de Jong , Hélène Esnault , Michael Groechenig

The principles underlying the art of origami paper folding can be applied to design sophisticated metamaterials with unique mechanical properties. By exploiting the flat crease patterns that determine the dynamic folding and unfolding…

This extended abstract presents an overview on NP-hard optimization problems with multiple interdependent components. These problems occur in many real-world applications: industrial applications, engineering, and logistics. The fact that…

Artificial Intelligence · Computer Science 2016-06-23 Mohamed El Yafrani , Belaïd Ahiod

Origami inspired architectures offer a powerful route toward lightweight, reconfigurable, and programmable robotic systems. Yet, a unified mechanics framework capable of seamlessly bridging rigid folding, elastic deformation, and stability…

Robotics · Computer Science 2026-03-17 Bohan Zhang , Bo Wang , Huajiang Ouyang , Zhigang Wu , Haohao Bi , Jiawei Xu , Mingchao Liu , Weicheng Huang

The ancient art of origami, traditionally used to transform simple sheets into intricate objects, also holds potential for diverse engineering applications, such as shape morphing and robotics. In this study, we demonstrate that one of the…

Robotics · Computer Science 2024-10-29 Davood Farhadi , Laura Pernigoni , David Melancon , Katia Bertoldi

It has recently been shown that the problem of testing global convexity of polynomials of degree four is {strongly} NP-hard, answering an open question of N.Z. Shor. This result is minimal in the degree of the polynomial when global…

Optimization and Control · Mathematics 2019-03-14 Amir Ali Ahmadi , Georgina Hall

We analyze the computational complexity of Tetris clearing (determining whether the player can clear an initial board using a given sequence of pieces) and survival (determining whether the player can avoid losing before placing all the…

Computational Complexity · Computer Science 2026-03-11 MIT Hardness Group , Josh Brunner , Erik D. Demaine , Della Hendrickson , Jeffery Li

In this paper, we provide an $O(n \mathrm{polylog} n)$ bound on the expected complexity of the randomly weighted Voronoi diagram of a set of $n$ sites in the plane, where the sites can be either points, interior-disjoint convex sets, or…

Computational Geometry · Computer Science 2015-03-23 Sariel Har-Peled , Benjamin Raichel

Adhesion is a fundamental phenomenon that plays a role in many engineering and biological applications. This paper concerns the use of machine learning to characterize the effective adhesive properties when a thin film is peeled from a…

Applied Physics · Physics 2023-09-04 Maximo Cravero Baraja , Kaushik Bhattacharya

Origami structures have been proposed as a means of creating three-dimensional structures from the micro- to the macroscale, and as a means of fabricating mechanical metamaterials. The design of such structures requires a deep understanding…

Soft Condensed Matter · Physics 2020-04-29 M. Berry , M. E. Lee-Trimble , C. D. Santangelo

Origami metamaterials typically consist of folded sheets with periodic patterns, conferring them with remarkable mechanical properties. In the context of Continuum Mechanics, the majority of existing predictive methods are mechanism analogs…

Soft Condensed Matter · Physics 2026-01-22 Xuwen Li , Amin Jamalimehr , Mathias Legrand , Damiano Pasini

Clustering a graph when the clusters can overlap can be seen from three different angles: We may look for cliques that cover the edges of the graph with bounded overlap, we may look to add or delete few edges to uncover the cluster…

Data Structures and Algorithms · Computer Science 2024-04-04 Alexander Firbas , Alexander Dobler , Fabian Holzer , Jakob Schafellner , Manuel Sorge , Anaïs Villedieu , Monika Wißmann

Recoverable robust optimization is a popular multi-stage approach, in which it is possible to adjust a first-stage solution after the uncertain cost scenario is revealed. We consider recoverable robust optimization in combination with…

Computational Complexity · Computer Science 2024-11-28 Christoph Grüne , Lasse Wulf
‹ Prev 1 8 9 10 Next ›