English
Related papers

Related papers: The Pattern Complexity of the 2-Dimensional Paperf…

200 papers

The paper concerns clustering with respect to the shape and size of 2D contours that are boundaries of cross-sections of 3D objects of revolution. We propose a number of similarity measures based on combined disparate Procrustes analysis…

Computer Vision and Pattern Recognition · Computer Science 2021-11-15 Agnieszka Kaliszewska , Monika Syga

In the abstract Tile Assembly Model, self-assembling systems consisting of tiles of different colors can form structures on which colored patterns are ``painted.'' We explore the complexity, in terms of the numbers of unique tile types…

Emerging Technologies · Computer Science 2024-03-12 Phillip Drake , Matthew J. Patitz , Scott M. Summers , Tyler Tracy

We introduce patterns on a triangular grid generated by paperfolding operations. We show that in case these patterns are defined using a periodic sequence of foldings, they can also be generated using substitution rules and compute…

Combinatorics · Mathematics 2021-04-16 Alexey Garber

By use of conformal field theory, we discover several exact factorizations of higher-order density correlation functions in critical two-dimensional percolation. Our formulas are valid in the upper half-plane, or any conformally equivalent…

Mathematical Physics · Physics 2008-11-26 Jacob J. H. Simmons , Peter Kleban , Robert M. Ziff

In this paper we present some linear algebra behind quadratic parts of quadratically flat complex points of codimension two real submanifold in a complex manifold. Assuming some extra nondegenericity and using the result of Hong, complete…

Complex Variables · Mathematics 2018-02-08 Marko Slapar , Tadej Starčič

The standard unitarity-cut method is applied to several massive two-dimensional models, including the world-sheet AdS$_5\times S^5$ superstring, to compute $2\to 2$ scattering S-matrices at one loop from tree level amplitudes. Evidence is…

High Energy Physics - Theory · Physics 2014-01-03 Valentina Forini , Lorenzo Bianchi , Ben Hoare

In this paper, we consider a simple class of stratified spaces -- 2-complexes. We present an algorithm that learns the abstract structure of an embedded 2-complex from a point cloud sampled from it. We use tools and inspiration from…

Computational Geometry · Computer Science 2023-05-05 Yossi Bokor Bleile

Just how many different connected shapes result from slicing a cube along some of its edges and unfolding it into the plane? In this article we answer this question by viewing the cube both as a surface and as a graph of vertices and edges.…

Group Theory · Mathematics 2016-04-20 Richard Goldstone , Robert Suzzi Valli

We study the space of 2-frieze patterns generalizing that of the classical Coxeter-Conway frieze patterns. The geometric realization of this space is the space of n-gons (in the projective plane and in 3-dimensional vector space) which is a…

Algebraic Geometry · Mathematics 2011-07-19 Sophie Morier-Genoud , Valentin Ovsienko , Serge Tabachnikov

An edge tessellation is a tiling of the plane generated by reflecting a polygon in its edges. We prove that a polygon generating an edge tessellation is one the following eight types: a rectangle; an equilateral, 60-right, isosceles right,…

Geometric Topology · Mathematics 2011-08-31 Matthew Kirby , Ron Umble

When a single long piece of elastic wire is injected trough channels into a confining two-dimensional cavity, a complex structure of hierarchical loops is formed. In the limit of maximum packing density, these structures are described by…

Soft Condensed Matter · Physics 2008-11-19 M A F Gomes , V P Brito , A S O Coelho , C C Donato

Motivated by the fact that 2-dimensional data have become popularly used in many applications without being much considered its integrity checking. We introduce the problem of detecting a corrupted area in a 2-dimensional space, and…

Data Structures and Algorithms · Computer Science 2014-04-08 YounSun Cho

2-stratifolds are a generalization of 2-manifolds in that there are disjoint simple closed curves where several sheets meet. They arise in the study of categorical invariants of 3-manifolds and may have applications to topological data…

Geometric Topology · Mathematics 2015-05-14 J. C. Gómez-Larrañaga , F. González-Acuña , Wolfgang Heil

Folding a sequence $S$ into a multidimensional box is a method that is used to construct multidimensional codes. The well known operation of folding is generalized in a way that the sequence $S$ can be folded into various shapes. The new…

Information Theory · Computer Science 2009-07-29 Tuvi Etzion

We present structural properties of two-dimensional polymers as far as they can be described by percolation theory. The percolation threshold, critical exponents and fractal dimensions of clusters are determined by computer simulation and…

Condensed Matter · Physics 2009-10-22 Christian Muenkel , Dieter W. Heermann

Modeling folding surfaces with nonzero thickness is of practical interest for mechanical engineering. There are many existing approaches that account for material thickness in folding applications. We propose a new systematic and broadly…

Computational Geometry · Computer Science 2016-01-22 Jason S. Ku , Erik D. Demaine

We obtain a novel formula for characteristic polynomials of deformations of the Braid arrangement using the notion of levels of regions. As an application, we recover and strengthen results of Chen et al. on the characteristic polynomial of…

Combinatorics · Mathematics 2024-11-07 Ningxin Zhang

We give an explicit formula for a 2-fold branched covering from $\mathbb{CP}^2$ to $S^4$, and relate it to other maps between quotients of $S^2\times{S^2}$.

Geometric Topology · Mathematics 2017-05-16 J. A. Hillman

We investigate the graphs formed from the vertices and creases of an origami pattern that can be folded flat along all of its creases. As we show, this is possible for a tree if and only if the internal vertices of the tree all have even…

Computational Geometry · Computer Science 2019-07-16 David Eppstein

We present a novel sparse modeling approach to non-rigid shape matching using only the ability to detect repeatable regions. As the input to our algorithm, we are given only two sets of regions in two shapes; no descriptors are provided so…

Graphics · Computer Science 2012-10-01 J. Pokrass , A. M. Bronstein , M. M. Bronstein , P. Sprechmann , G. Sapiro