Stokes polyhedra for $X$-shaped polyminos by Yu. Baryshnikov, L. Hickok, N. Orlow, S. Son

Subjects: “…stokes polyhedra…”
Get full text

On packing and covering polyhedra in infinite dimensions by Rademacher, Luis, Toriello, Alejandro, Vielma Centeno, Juan Pablo

“…We consider the natural generalizations of packing and covering polyhedra in infinite dimensions, and study issues related to duality and integrality of extreme points for these sets. …”
Get full text
Get full text

Embedding Formulations and Complexity for Unions of Polyhedra by Vielma Centeno, Juan Pablo

Get full text
Get full text

Finding closed quasigeodesics on convex polyhedra by Demaine, Erik D, Hesterberg, Adam Classen, Ku, Jason S

Get full text

Integral Convex Polyhedra and an Approach to Integralization by Edelberg, Murray

Get full text

A Heterarchical Program for Recognition of Polyhedra by Shirai, Yoshiaki

Get full text

A Heterarchical Program for Recognition of Polyhedra by Shirai, Yoshiaki

“…Recognition of polyhedra by a heterarchical program is presented. …”
Get full text

Polyhedra structures and the evolution of the insect viruses. by Ji, X, Axford, D, Owen, R, Evans, G, Ginn, H, Sutton, G, Stuart, D

“…Polyhedra represent an ancient system used by a number of insect viruses to protect virions during long periods of environmental exposure. …”

Beyond the cube : the architecture of space frames and polyhedra / by Gabriel, J. Francois

GEOMETRY AS ASSEMBLY IN ARCHITECTURE. SEMI-REGULAR POLYHEDRA by Ana - Maria Graur

Subjects: Get full text

Virtual Elements on polyhedra with a curved face by Franco Brezzi, L. Donatella Marini

Get full text

Metal Organic Polygons and Polyhedra: Instabilities and Remedies by Soumen K. Samanta

Subjects: “…metal organic polygons and polyhedra…”
Get full text

An Approach to Three-Dimensional Decomposition and Description of Polyhedra by Hollerbach, John M.

Get full text

Shortest Paths, Network Design and Associated Polyhedra by Magnanti, Thomas L., Mirchandani, Prakash

Get full text

Capacitated Trees, Capacitated Routing, and Associated Polyhedra by Araque, Jésus Rafael, Hall, Leslie A., Magnanti, Thomas L.

“…For each of these problems, and for a forest relaxation of the minimal spanning tree problem, we introduce a number of new valid inequalities and specify conditions for ensuring when these inequalities are facets for the associated integer polyhedra. The inequalities are defined by one of several underlying support graphs: (i) a multistar, a "star" with a clique replacing the central vertex; (ii) a clique cluster, a collection of cliques intersecting at a single vertex, or more generally at a central" clique; and (iii) a ladybug, consisting of a multistar as a head and a clique as a body. …”
Get full text

A Generalization of the Source Unfolding of Convex Polyhedra by Demaine, Erik D., Lubiw, Anna

Get full text
Get full text

Continuously Flattening Polyhedra Using Straight Skeletons by Demaine, Erik D., Demaine, Martin L., Itoh, Jin-ichi, Lubiw, Anna, Nara, Chie, O'Rourke, Joseph, Abel, Zachary Ryan

“…We show that our method solves the fold-and-cut problem for convex polyhedra in any dimension. As an additional application, we show how a limiting form of our algorithm gives a general design technique for flat origami tessellations, for any spiderweb (planar graph with all-positive equilibrium stress).…”
Get full text
Get full text
Get full text

Automated rational design of metal-organic polyhedra by Kondinski, Aleksandar, Menon, Angiras, Nurkowski, Daniel, Farazi, Feroz, Mosbach, Sebastian, Akroyd, Jethro, Kraft, Markus

“…Metal-organic polyhedra (MOPs) are hybrid organic-inorganic nanomolecules, whose rational design depends on harmonious consideration of chemical complementarity and spatial compatibility between two or more types of chemical building units (CBUs). …”
Get full text

Volume Polynomials for Some Polyhedra in Spaces of Constant Curvature by D. I. Sabitov, I. Kh. Sabitov

“…In this work we indicate some special classes of polyhedra for which these polynomials can be found by a sufficiently effective algorithm which also works in spaces of constsnt curvature of any dimension.…”
Get full text

Closed Locally Minimal Networks on the Surfaces of Convex Polyhedra by N. P. Strelkova

“…We study such networks on the surfaces of convex polyhedra and discuss the problem of describing the set of all convex polyhedra that have such networks. …”
Get full text