Related papers: How to sew in practice?

We present two universal hinge patterns that enable a strip of material to fold into any connected surface made up of unit squares on the 3D cube grid--for example, the surface of any polycube. The folding is efficient: for target surfaces…

In this note, we propose a straightforward method to produce an straight-line embedding of a planar graph where one face of a graph is fixed in the plane as a star-shaped polygon. It is based on minimizing discrete Dirichlet energies,…

An approach is shown that proves various theorems of plane geometry in an algorithmic manner. The approach affords transparent proofs of a generalization of the Theorem of Morley and other well known results by casting them in terms of…

Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…

We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…

Neural networks are widely used as a model for classification in a large variety of tasks. Typically, a learnable transformation (i.e. the classifier) is placed at the end of such models returning a value for each class used for…

We consider a matching problem in a bipartite graph $G$ where every vertex has a capacity and a strict preference order on its neighbors. Furthermore, there is a cost function on the edge set. We assume $G$ admits a perfect matching, i.e.,…

In the peg insertion task, human pays attention to the seam between the peg and the hole and tries to fill it continuously with visual feedback. By imitating the human behavior, we design architectures with position and orientation…

The purpose of this paper is to find the characterization of the Sheffer polynomial sets satisfying the d-orthogonality conditions. The generating function form of these polynomial sets is given in Theorem 2.2. As applications of the…

Wythoff's construction associates a uniform polytope to a Coxeter diagram whose vertices are decorated with crosses, which indicate the subgroup stabilizing a generic point. Champagne, Kjiri, Patera, and Sharp remarked that by associating…

We consider the realization space of the $d$-dimensional cube, and show that any two realizations are connected by a finite sequence of projective transformations and normal transformations. We use this fact to define an analog of the…

An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that…

We prove that a simple knot in the lens space $L(p,q)$ fibers if and only if its order in homology does not divide any remainder occurring in the Euclidean algorithm applied to the pair $(p,q)$. One corollary is that if $p=m^2$ is a perfect…

A T-curve of degree $d$ is given by a regular unimodular triangulation of $d \cdot \Delta_2$ together with a sign distribution on its lattice points. By Viro's Patchworking Theorem, this determines the ambient isotopy type (a.k.a. real…

We investigate the problem of carving an $n$-face triangulated three-dimensional polytope using a tool to make cuts modelled by either a half-plane or sweeps from an infinite ray. In the case of half-planes cuts, we present a deterministic…

In this paper, we introduce a neighbor embedding framework for manifold alignment. We demonstrate the efficacy of the framework using a manifold-aligned version of the uniform manifold approximation and projection algorithm. We show that…

We prove the following theorem, which is related to McMullen's problem on projective transformations of polytopes; let $2\leq k\leq \lfloor{\frac{d}{2}}\rfloor$ and $\nu{(d, k)}$ be the largest number such that any set of $\nu{(d,k)}$…

This paper is concerned with the concept of linear repetitivity in the theory of tilings. We prove a general uniform subadditive ergodic theorem for linearly repetitive tilings. This theorem unifies and extends various known (sub)additive…

We construct a version of kneading theory for families of monotonous functions on the real line. The generality of the setup covers two classical results from Milnor-Thurston's kneading theory: the first one is to dynamically characterise…

We train deep generative models on datasets of reflexive polytopes. This enables us to compare how well the models have picked up on various global properties of generated samples. Our datasets are complete in the sense that every single…