Related papers: Reconstructing a Polyhedron between Polygons in Pa…
A plane tiling consisting of congruent copies of a shape is isohedral provided that for any pair of copies, there exists a symmetry of the tiling mapping one copy to the other. We give a $O(n\log^2{n})$-time algorithm for deciding if a…
In this paper we settle the computational complexity of two open problems related to the extension of the notion of level planarity to surfaces different from the plane. Namely, we show that the problems of testing the existence of a level…
This paper investigates the rigidity of bordered polyhedral surfaces. Using the variational principle, we show that bordered polyhedral surfaces are determined by boundary value and discrete curvatures on the interior edges. As a corollary,…
A knitted surface is a surface with or without closed components smoothly properly embedded in $D^2 \times B^2$, which is a generalization of a braided surface. A knitted surface is called a 2-dimensional knit if its boundary is the closure…
Topological band theory provides a conceptual framework to predict or even engineer robust metallic states at the boundaries of topologically distinct phases. The bulk-boundary correspondence requires that a topological electronic phase…
A new formula is obtained in algebraic topology, in terms of Betti numbers, and a new method, called the spinal method, is suggested and developed for generating quadrangulations of closed orientable surfaces. Those surfaces arise as the…
This is a study of the construction of particular regular sub-n-gons T in regular n-gons P using a special system of chords of P. In particular, some of these sub-n-gons have areas which are integer divisors of the area of the given n-gon…
We study the long-standing open problem of efficiently testing rectilinear planarity of series-parallel graphs (SP-graphs) in the variable embedding setting. A key ingredient behind the design of a linear-time testing algorithm for…
The circumcircle of a planar convex polygon P is a circle C that passes through all vertices of P. If such a C exists, then P is said to be cyclic. Fix C to have unit radius. While any two angles of a uniform cyclic triangle are negatively…
Given a set $P$ of $n$ points in the plane, we solve the problems of constructing a geometric planar graph spanning $P$ 1) of minimum degree 2, and 2) which is 2-edge connected, respectively, and has max edge length bounded by a factor of 2…
Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. Typically, it is an easy exercise to prove connectivity of a…
We prove that, a suitable correlation between the system parameters can trigger topological phase transition and flat bands in a multi strand Creutz ladder network, when a staggered second neighbor interaction is included along the x axis.…
The existence of pi-bonds on topological insulator surfaces is found to be closely related to the phenomena of surface conduction and surface band spin polarization. A pi-bond trimer or pi-bond dimer on the surface can form open conjugated…
We describe a new family of triply-periodic minimal surfaces with hexagonal symmetry, related to the quartz (qtz) and its dual (the qzd net). We provide a solution to the period problem and provide a parametrisation of these surfaces, that…
The strain fields of periodically buckled graphene induce a periodic pseudo-magnetic field (PMF) that modifies the electronic band structure. From the geometry, amplitude, and period of the periodic pseudo-magnetic field, we determine the…
A polytope $P$ is circumscribed about a convex body $\Phi\subset \mathbb{R}^n$ if $\Phi\subset P$ and each facet of $P$ is contained in a support hyperplane of $\Phi$. We say that a convex body $\Phi\subset \mathbb{R}^n$ is a rotor of a…
If a (cusped) surface S admits an ideal triangulation T with no shears, we show an efficient algorithm to give S as a quotient of hypebolic plane by a subgroup of PSL(2, Z). The algorithm runs in time O(n log n), where n is the number of…
Gordon and Litherland showed that all compact, unoriented, possibly non-orientable surfaces in $S^3$ bounded by a link are realted by attaching/deleting tubes and half twisted bands. In this note we give an elementary proof for this result.
Steinitz's theorem states that a graph $G$ is the edge-graph of a $3$-dimensional convex polyhedron if and only if, $G$ is simple, plane and $3$-connected. We prove an analogue of this theorem for ball polyhedra, that is, for intersections…
We establish a general `gluing theorem', which states roughly that if two nondegenerate constant mean curvature surfaces are juxtaposed, so that their tangent planes are parallel and very close to one another, but oppositely oriented, then…