Related papers: Finding the optimal nets for self-folding Kirigami
Kirigami patterned materials have found several applications in recent years due to their ability to assume complicated shapes and exhibit emergent physical properties when exposed to external forces. Consisting of an array of cuts in a…
Many computer vision pipelines involve dynamic programming primitives such as finding a shortest path or the minimum energy solution in a tree-shaped probabilistic graphical model. In such cases, extracting not merely the best, but the set…
The problems of maximizing the spectral radius and the number of spanning trees in a class of bipartite graphs with certain degree constraints are considered. In both the problems, the optimal graph is conjectured to be a Ferrers graph.…
Social networks have become an inseparable part of human life and processing them in an efficient manner is a top priority in the study of networks. These networks are highly dynamic and they are growing incessantly. Inspired by the concept…
Soft robots employing compliant materials and deformable structures offer great potential for wearable devices that are comfortable and safe for human interaction. However, achieving both structural integrity and compliance for comfort…
In this paper, we show that deciding rigid foldability of a given crease pattern using all creases is weakly NP-hard by a reduction from Partition, and that deciding rigid foldability with optional creases is strongly NP-hard by a reduction…
We propose an optimisation method for the inverse structural design of self-assembly of anisotropic patchy particles. The anisotropic interaction can be expressed by the spherical harmonics of the surface pattern on a patchy particle, and…
The maximum edge-weight clique problem is to find a clique whose sum of edge-weight is the maximum for a given edge-weighted undirected graph. The problem is NP-hard and some branch-and-bound algorithms have been proposed. In this paper, we…
Lattices and their underlying symmetries play a central role in determining the physical properties and applications of many natural and engineered materials. By bridging the lattice geometry and rigid-folding kinematics, this study…
The number of spanning trees in a graph $G$ is the total number of distinct spanning subgraphs of $G$ that are trees. In this paper we characterize the unique graph with a prescribed vertex (resp. edge) connectivity, minimum degree and…
We consider the problems of computing maximal palindromes and distinct palindromes in a trie. A trie is a natural generalization of a string, which can be seen as a single-path tree. There is a linear-time offline algorithm to compute…
One powerful technique to solve NP-hard optimization problems in practice is branch-and-reduce search---which is branch-and-bound that intermixes branching with reductions to decrease the input size. While this technique is known to be very…
Origami describes rules for creating folded structures from patterns on a flat sheet, but does not prescribe how patterns can be designed to fit target shapes. Here, starting from the simplest periodic origami pattern that yields one…
We combine large-scale atomistic modelling with continuum elastic theory to study the shapes of graphene sheets embedding nanoscale kirigami. Lattice segments are selectively removed from a flat graphene sheet and the structure is allowed…
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…
We devise an inverse statistical-mechanical methodology to find optimized interaction potentials that lead spontaneously to a target many-particle configuration. Target structures can possess varying degrees of disorder, thus extending the…
Fully soft bistable mechanisms have shown extensive applications ranging from soft robotics, wearable devices, and medical tools, to energy harvesting. However, the lack of design and fabrication methods that are easy and potentially…
Based on a local greedy numerical algorithm, we compute the topology of weighted, directed, and of unlimited extension networks of non identical Kuramoto oscillators which simultaneously satisfy 2 criteria: i) global frequency…
We present a simple, accessible method for autonomously transforming flat plastic sheets into intricate three-dimensional structures using only uniform heating and common tools such as household ovens and scissors. Our approach combines…
We present computer simulations of three systems of randomly branching polymers in d=3 dimensions: ideal trees and self-avoiding trees with annealed and quenched connectivities. In all cases, we performed a detailed analysis of trees…