Related papers: Transforming triangulations on non planar-surfaces
The space of topological decompositions into triangulations of a surface has a natural graph structure where two triangulations share an edge if they are related by a so-called flip. This space is a sort of combinatorial Teichm\"uller space…
We show existence of centrally symmetric maps on surfaces all of whose faces are quadrangles and pentagons for each orientable genus $g \geq 0$. We also show existence of centrally symmetric maps on surfaces all of whose faces are hexagons…
We present explicit filtration/backprojection-type formulae for the inversion of the spherical (circular) mean transform with the centers lying on the boundary of some polyhedra (or polygons, in 2D). The formulae are derived using the…
The class of 2-dimensional non-integrable flat dynamical systems has a rather extensive literature with many deep results, but the methods developed for this type of problems, both the traditional approach via Teichm\"{u}ller geometry and…
In this paper we consider planar polygons with parallel opposite sides. This type of polygons can be regarded as discretizations of closed convex planar curves by taking tangent lines at samples with pairwise parallel tangents. For this…
The image and the inverse image of a polyhedron under a linear transformation are polyhedrons.
We introduce the notion of alteration of a surface embedded in a 3-manifold extending that of compression. We see that given two Seifert surfaces of the same link are related to each other by ``single'' alteration, even if they are not by…
The paper presents an analog of the old result by the author and V. Voevodsky, according to which a Riemann surface admits a conformal structure, defined by an equilateral triangulation, if and only if the corresponding algebraic curve can…
A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…
The concept of turnaround surface in an accelerating universe is generalized to arbitrarily large deviations from spherical symmetry, to close the gap between the idealized theoretical literature and the real world observed by astronomers.…
We compute the number of triangulations of a convex $k$-gon each of whose sides is subdivided by $r-1$ points. We find explicit formulas and generating functions, and we determine the asymptotic behaviour of these numbers as $k$ and/or $r$…
We present new examples of topologically convex edge-ununfoldable polyhedra, i.e., polyhedra that are combinatorially equivalent to convex polyhedra, yet cannot be cut along their edges and unfolded into one planar piece without overlap.…
We study infinitesimal conformal deformations of a triangulated surface in Euclidean space and investigate the change in its extrinsic geometry. A deformation of vertices is conformal if it preserves length cross-ratios. On one hand,…
We show that no minimal vertex triangulation of a closed, connected, orientable 2-manifold of genus 6 admits a polyhedral embedding in R^3. We also provide examples of minimal vertex triangulations of closed, connected, orientable…
The triangulations of a surface $\Sigma$ with a prescribed set of vertices can be endowed with a graph structure $\mathcal{F}(\Sigma)$. Its edges connect two triangulations that differ by a single arc. It is known that, when $\Sigma$ is a…
We completely classify edge-to-edge tilings of the sphere by congruent quadrilaterals. As part of the classification, we also present a modern version of the classification of edge-to-edge tilings of the sphere by congruent triangles.…
We discuss elliptic Pl\"ucker transformations of three-dimensional elliptic spaces. These are permutations on the set of lines such that any two related (orthogonally intersecting or identical) lines go over to related lines in both…
We give a short proof of the contractibility of the space of geodesic triangulations with fixed combinatorial type of a convex polygon in the Euclidean plane. Moreover, for any $n>0$, we show that there exists a space of geodesic…
For both triangulations of point sets and simple polygons, it is known that determining the flip distance between two triangulations is an NP-hard problem. To gain more insight into flips of triangulations and to characterize "where edges…
There are four non-isomorphic configurations of triples that can form a triangle in a $3$-uniform hypergraph. Forbidding different combinations of these four configurations, fifteen extremal problems can be defined, several of which already…