Related papers: An algorithm that constructs irreducible triangula…
Consider the Euclidean space $\mathbb{R}^3$ endowed with a canonical semi-symmetric non-metric connection determined by a vector field $\mathsf{C}\in\mathfrak{X}(\mathbb{R}^3)$. We study surfaces when the sectional curvature with respect to…
A triangulation of a surface is called $q$-equivelar if each of its vertices is incident with exactly $q$ triangles. In 1972 Altshuler had shown that an equivelar triangulation of torus has a Hamiltonian Circuit. Here we present a necessary…
We associate to triangulations of infinite type surface a type of flip graph where simultaneous flips are allowed. Our main focus is on understanding exactly when two triangulations can be related by a sequence of flips. A consequence of…
A fast algorithm for counting intersections of two normal curves on a triangulated surface is proposed. It yields a convenient way for treating mapping class groups of punctured surfaces by presenting mapping classes by matrices, and the…
A triangulation is called $z$-knotted if it has a single zigzag (up to reversing). A $z$-orientation on a triangulation is a minimal collection of zigzags which double covers the set of edges. An edge is of type I if zigzags from the…
For $m\in \IN, m\geq 1,$ we determine the irreducible components of the $m-th$ jet scheme of a toric surface $S.$ For $m$ big enough, we connect the number of a class of these irreducible components to the number of exceptional divisors on…
We prove that fundamental groups of non-orientable 3-manifolds have a solvable conjugacy problem, and construct an algorithm. Together with our earlier work on the conjugacy problem in groups on orientable geometrizable 3-manifolds, all…
Any two triangulations of a closed surface with the same number of vertices can be transformed into each other by a sequence of regular flips, provided the number of vertices exceeds a number N depending on the surface. Examples show that…
Let $\Pi$ be a convex decomposition of a set $P$ of $n\geq 3$ points in general position in the plane. If $\Pi$ consists of more than one polygon, then either $\Pi$ contains a deletable edge or $\Pi$ contains a contractible edge.
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…
Consider a geodesic triangle on a surface of constant curvature and subdivide it recursively into 4 triangles by joining the midpoints of its edges. We show the existence of a uniform $\delta>0$ such that, at any step of the subdivision,…
A quadric in $\R P^3$ cuts a curve of degree 6 on a cubic surface in $\R P^3$. The papers classifies the nonsingular curves cut in this way on non-singular cubic surfaces up to homeomorphism. Two issues new in the study related to the first…
An efficient computer algorithm is described for the perspective drawing of a wide class of surfaces. The class includes surfaces corresponding lo single-valued, continuous functions which are defined over rectangular domains. The algorithm…
Topological triangulations of orientable and non-orientable surfaces with arbitrary genus have important applications in quantum geometry, graph theory and statistical physics. However, until now only the asymptotics for 2-spheres are known…
In this paper we prove that any Riemannian surface, with no restriction of curvature at all, can be decomposed into blocks belonging just to some of these types: generalized Y-pieces, generalized funnels and halfplanes.
Solving a long-standing open question in convex geometry, we will show that typical convex surfaces contain points of infinite curvature in all tangent directions. To prove this, we use an easy curvature definition imitating the idea of…
The ruled surface is a typical modeling surface in computer aided geometric design. It is usually given in the standard parametric form. However, it can also be in the forms than the standard one. For these forms, it is necessary to…
For many fundamental problems in computational topology, such as unknot recognition and $3$-sphere recognition, the existence of a polynomial-time solution remains unknown. A major algorithmic tool behind some of the best known algorithms…
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,…
We consider the problem of computing a triangulation of the real projective plane P2, given a finite point set S={p1, p2,..., pn} as input. We prove that a triangulation of P2 always exists if at least six points in S are in general…