相关论文: Triangulations into Groups

This paper presents a quantum algorithm for triangle finding over sparse graphs that improves over the previous best quantum algorithm for this task by Buhrman et al. [SIAM Journal on Computing, 2005]. Our algorithm is based on the recent…

Square-tiled surfaces can be classified by their number of squares and their cylinder diagrams (also called realizable separatrix diagrams). For the case of $n$ squares and two cone points with angle $4 \pi$ each, we set up and parametrize…

Every surface that is intrinsically polyhedral can be represented by a portalgon: a collection of polygons in the Euclidean plane with some pairs of equally long edges abstractly identified. While this representation is arguably simpler…

We describe an algorithm to decide whether two genus-two surfaces embedded in the 3-sphere are isotopic or not. The algorithm employs well-known techniques in 3-manifolds topology, as well as a new algorithmic solution to a problem on free…

We present a practical algorithm to test whether a 3-manifold given by a triangulation or an ideal triangulation contains a closed essential surface. This property has important theoretical and algorithmic consequences. As a testament to…

When the boundary of a familiar object is shown by a series of isolated dots, humans can often recognize the object with ease. This ability can be sustained with addition of distracting dots around the object. However, such capability has…

In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of G in R^2, with a bounding face defined by a polygonal…

We give a concrete example of an infinite sequence of $(p_n, q_n)$-lens spaces $L(p_n, q_n)$ with natural triangulations $T(p_n, q_n)$ with $p_n$ taterahedra such that $L(p_n, q_n)$ contains a certain non-orientable closed surface which is…

Visualization of implicit surfaces is an actively researched topic. While raytracing can produce high quality images, it is not well suited for creating a quick preview of the surface. Indirect algorithms (e.g. Marching Cubes) create an…

We give a randomized algorithm that properly colors the vertices of a triangle-free graph G on n vertices using O(\Delta(G)/ log \Delta(G)) colors, where \Delta(G) is the maximum degree of G. The algorithm takes O(n\Delta2(G)log\Delta(G))…

In this paper we provide, first, a general symbolic algorithm for computing the symmetries of a given rational surface, based on the classical differential invariants of surfaces, i.e. Gauss curvature and mean curvature. In practice, the…

Let T(N) be the subgroup of the mapping class group of a nonorientable surface N (possibly with punctures and/or boundary components) generated by twists about two-sided circles. We obtain a simple generating set for T(N). As an application…

We construct certain subgroups of hyperbolic triangle groups which we call "congruence" subgroups. These groups include the classical congruence subgroups of SL_2(ZZ), Hecke triangle groups, and 19 families of arithmetic triangle groups…

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.…

Let M be the interior of a compact 3-manifold with non-empty boundary, and T be an ideal (topological) triangulation of M. This paper describes necessary and sufficient conditions for the existence of angle structures, semi-angle structures…

Satisfying spin-assignments in triangulations of a surface are states of minimum energy of the antiferromagnetic Ising model on triangulations which correspond (via geometric duality) to perfect matchings in cubic bridgeless graphs. In this…

We describe a simple geometric transformation of triangles which leads to an efficient and effective algorithm to smooth triangle and tetrahedral meshes. Our focus lies on the convergence properties of this algorithm: we prove the…

We prove that any triangulation of a surface different from the sphere and the projective plane admits an orientation without sinks such that every vertex has outdegree divisible by three. This confirms a conjecture of Bar\'at and Thomassen…

Let $S$ be a regular minimal surface of general type over the field of complex numbers, and $\mathrm{Aut}_\mathbb{Q}(S)$ the subgroup of automorphisms acting trivially on $H^*(S,\mathbb{Q})$. It has been known since twenty years that…

The spaces of triangulations of a given manifold have been widely studied. The celebrated theorem of Pachner~\cite{Pachner} says that any two triangulations of a given manifold can be connected by a sequence of bistellar moves, or Pachner…