873 research outputs found

    Folding equilateral plane graphs

    Get PDF
    22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. ProceedingsWe consider two types of folding applied to equilateral plane graph linkages. First, under continuous folding motions, we show how to reconfigure any linear equilateral tree (lying on a line) into a canonical configuration. By contrast, such reconfiguration is known to be impossible for linear (nonequilateral) trees and for (nonlinear) equilateral trees. Second, under instantaneous folding motions, we show that an equilateral plane graph has a noncrossing linear folded state if and only if it is bipartite. Not only is the equilateral constraint necessary for this result, but we show that it is strongly NP-complete to decide whether a (nonequilateral) plane graph has a linear folded state. Equivalently, we show strong NP-completeness of deciding whether an abstract metric polyhedral complex with one central vertex has a noncrossing flat folded state with a specified “outside region”. By contrast, the analogous problem for a polyhedral manifold with one central vertex (single-vertex origami) is only weakly NP-complete

    Non-Euclidean geometry in nature

    Full text link
    I describe the manifestation of the non-Euclidean geometry in the behavior of collective observables of some complex physical systems. Specifically, I consider the formation of equilibrium shapes of plants and statistics of sparse random graphs. For these systems I discuss the following interlinked questions: (i) the optimal embedding of plants leaves in the three-dimensional space, (ii) the spectral statistics of sparse random matrix ensembles.Comment: 52 pages, 21 figures, last section is rewritten, a reference to chaotic Hamiltonian systems is adde

    Locked and Unlocked Chains of Planar Shapes

    Full text link
    We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonoverlapping rigid planar shapes (Jordan regions) that are hinged together sequentially at rotatable joints. Our goal is to characterize the families of planar shapes that admit locked chains, where some configurations cannot be reached by continuous reconfiguration without self-intersection, and which families of planar shapes guarantee universal foldability, where every chain is guaranteed to have a connected configuration space. Previously, only obtuse triangles were known to admit locked shapes, and only line segments were known to guarantee universal foldability. We show that a surprisingly general family of planar shapes, called slender adornments, guarantees universal foldability: roughly, the distance from each edge along the path along the boundary of the slender adornment to each hinge should be monotone. In contrast, we show that isosceles triangles with any desired apex angle less than 90 degrees admit locked chains, which is precisely the threshold beyond which the inward-normal property no longer holds.Comment: 23 pages, 25 figures, Latex; full journal version with all proof details. (Fixed crash-induced bugs in the abstract.

    Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths

    Get PDF
    When can a plane graph with prescribed edge lengths and prescribed angles (from among {0,180,360\{0,180^\circ, 360^\circ\}) be folded flat to lie in an infinitesimally thin line, without crossings? This problem generalizes the classic theory of single-vertex flat origami with prescribed mountain-valley assignment, which corresponds to the case of a cycle graph. We characterize such flat-foldable plane graphs by two obviously necessary but also sufficient conditions, proving a conjecture made in 2001: the angles at each vertex should sum to 360360^\circ, and every face of the graph must itself be flat foldable. This characterization leads to a linear-time algorithm for testing flat foldability of plane graphs with prescribed edge lengths and angles, and a polynomial-time algorithm for counting the number of distinct folded states.Comment: 21 pages, 10 figure

    Topology, connectivity and electronic structure of C and B cages and the corresponding nanotubes

    Full text link
    After a brief discussion of the structural trends which appear with increasing number of atoms in B cages, a one-to one correspondence between the connectivity of B cages and C cage structures will be proposed. The electronic level spectra of both systems from Hartree-Fock calculations is given and discussed. The relation of curvature introduced into an originally planar graphitic fragment to pentagonal 'defects' such as are present in buckminsterfullerene is also briefly treated. A study of the structure and electronic properties of B nanotubes will then be introduced. We start by presenting a solution of the free-electron network approach for a 'model boron' planar lattice with local coordination number 6. In particular the dispersion relation E(k) for the pi-electron bands, together with the corresponding electronic Density Of States (DOS), will be exhibited. This is then used within the zone folding scheme to obtain information about the electronic DOS of different nanotubes obtained by folding this model boron sheet. To obtain the self-consistent potential in which the valence electrons move in a nanotube, 'the March model' in its original form was invoked and results are reported for a carbon nanotube. Finally, heterostructures, such as BN cages and fluorinated buckminsterfullerene, will be briefly treated, the new feature here being electronegativity difference.Comment: 22 pages (revtex4) 12 figure

    Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes

    Get PDF
    We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration questions in both directions: Given a polygon, how many foldings are there? Given a polytope, how many unfoldings are there to simple polygons? Throughout we give special attention to convex polygons, and to regular polygons. We show that every convex polygon folds to an infinite number of distinct polytopes, but that their number of combinatorially distinct gluings is polynomial. There are, however, simple polygons with an exponential number of distinct gluings. In the reverse direction, we show that there are polytopes with an exponential number of distinct cuttings that lead to simple unfoldings. We establish necessary conditions for a polytope to have convex unfoldings, implying, for example, that among the Platonic solids, only the tetrahedron has a convex unfolding. We provide an inventory of the polytopes that may unfold to regular polygons, showing that, for n>6, there is essentially only one class of such polytopes.Comment: 54 pages, 33 figure
    corecore