相关论文: Counting locally flat-foldable origami configurati…

We give explicit origami embeddings of a 2-dimensional flat torus of any modulus in the 3-dimensional Euclidean space.

We derive new algebraic equations for the folding angle relationships in completely general degree-four rigid-foldable origami vertices, including both Euclidean (developable) and non-Euclidean cases. These equations in turn lead to novel,…

Origami-based structures play an important role in the realization of deployable mechanisms and unique mechanical properties via programmable deformation by folding. Among origami-based structures, tessellation by the coupling of origami…

A \emph{mixed graph} is a graph with directed edges, called arcs, and undirected edges. A $k$-coloring of the vertices is proper if colors from ${1,2,...,k}$ are assigned to each vertex such that $u$ and $v$ have different colors if $uv$ is…

Twisted few-layer graphene (tFLG) has emerged as an ideal model system for investigating novel strongly correlated and topological phenomena. However, the experimental construction of tFLG with high structural stability is still…

A $k$-coloring of a graph is an assignment of integers between $1$ and $k$ to vertices in the graph such that the endpoints of each edge receive different numbers. We study a local variation of the coloring problem, which imposes further…

We introduce a generalization of the well known graph (vertex) coloring problem, which we call the problem of \emph{component coloring of graphs}. Given a graph, the problem is to color the vertices using minimum number of colors so that…

Origami folded cylinders (origami bellows) have found increasingly sophisticated applications in space flight and medicine. In spite of this interest, a general understanding of the mechanics of an origami folded cylinder has been elusive.…

We consider embeddings of 3-regular graphs into 3-dimensional Cartesian coordinates, in such a way that two vertices are adjacent if and only if two of their three coordinates are equal (that is, if they lie on an axis-parallel line) and…

We develop an algorithmic framework for graph colouring that reduces the problem to verifying a local probabilistic property of the independent sets. With this we give, for any fixed $k\ge 3$ and $\varepsilon>0$, a randomised…

Constructing partitions of colored points is a well-studied problem in discrete and computational geometry. We study the problem of creating a minimum-cardinality partition into monochromatic islands. Our input is a set $S$ of $n$ points in…

We give an algorithm to calculate the minimal and maximal genus of the orientable closed surface where a graph $G$ can be embedded. For this, we construct some special branched coverings of the 2-sphere. We apply this algorithm to calculate…

While orthogonal drawings have a long history, smooth orthogonal drawings have been introduced only recently. So far, only planar drawings or drawings with an arbitrary number of crossings per edge have been studied. Recently, a lot of…

Creating complex spatial objects from a flat sheet of material using origami folding techniques has attracted attention in science and engineering. In the present work, we employ geometric properties of partially folded zigzag strips to…

We discuss the problem of embedding graphs in the plane with restrictions on the vertex mapping. In particular, we introduce a technique for drawing planar graphs with a fixed vertex mapping that bounds the number of times edges bend. An…

We show that deciding whether a given set of circles can be packed into a rectangle, an equilateral triangle, or a unit square are NP-hard problems, settling the complexity of these natural packing problems. On the positive side, we show…

A proper vertex-colouring of a graph G is said to be locally identifying if for any pair u,v of adjacent vertices with distinct closed neighbourhoods, the sets of colours in the closed neighbourhoods of u and v are different. We show that…

Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. After the geometric embedding is specified, there is an additional step that is often overlooked or ignored:…

We address the enumeration of properly q-colored planar maps, or more precisely, the enumeration of rooted planar maps M weighted by their chromatic polynomial \chi_M(q) and counted by the number of vertices and faces. We prove that the…

Schmith\"usen proved in 2004 that the Veech group of an origami is closely related to a subgroup of the automorphism group of the free group $F_2$. This result is significant in the sense that the framework of approachable Veech groups is…