Related papers: Triangulations into Groups

Given a multiset $S$ of $n$ positive integers and a target integer $t$, the subset sum problem is to decide if there is a subset of $S$ that sums up to $t$. We present a new divide-and-conquer algorithm that computes all the realizable…

In the point set embeddability problem, we are given a plane graph $G$ with $n$ vertices and a point set $S$ with $n$ points. Now the goal is to answer the question whether there exists a straight-line drawing of $G$ such that each vertex…

In this short note, we give a novel algorithm for $O(1)$ round triangle counting in bounded arboricity graphs. Counting triangles in $O(1)$ rounds (exactly) is listed as one of the interesting remaining open problems in the recent survey of…

We study the large scale geometry of the upper triangular subgroup of PSL(2,Z[1/n]), which arises naturally in a geometric context. We prove a quasi-isometry classification theorem and show that these groups are quasi-isometrically rigid…

We present a fast enumeration algorithm for combinatorial 2- and 3-manifolds. In particular, we enumerate all triangulated surfaces with 11 and 12 vertices and all triangulated 3-manifolds with 11 vertices. We further determine all…

We consider hyperbolic manifolds with boundary, which admit an ideal triangulation with n ideal triangles and one edge. We prove that the number of these manifolds is $\exp(n\ln(n)+O(n))$.

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…

A rational triangle is a triangle with rational sides and rational area. A Heron triangle is a triangle with integral sides and integral area. In this article we will show that there exist infinitely many rational parametrizations, in terms…

We fully generalize a previously-developed computational geometry tool [1] to perform large-scale simulations of arbitrary two-dimensional faceted surfaces $z = h(x,y)$. Our method uses a three-component facet/edge/junction storage model,…

This paper gives sharp linear bounds on the genus of a normal surface in a triangulated compact, orientable 3--manifold in terms of the quadrilaterals in its cell decomposition---different bounds arise from varying hypotheses on the surface…

There is a trivial $O(\frac{n^3}{T})$ time algorithm for approximate triangle counting where $T$ is the number of triangles in the graph and $n$ the number of vertices. At the same time, one may count triangles exactly using fast matrix…

This is the second in a series of papers in which we investigate ideal triangulations of the interiors of compact 3-manifolds with tori or Klein bottle boundaries. Such triangulations have been used with great effect, following the…

We study a generalization of the Fuchsian triangle groups to the hyperbolic 3-space, namely, the groups generated by half-turns in three hyperbolic lines. The role of the hyperbolic triangles is now played by the right-angled hexagons. This…

By introducing a finer version of the Kauffman bracket skein algebra, we show how to decompose the Kauffman bracket skein algebra of a surface into elementary blocks corresponding to the triangles in an ideal triangulation of the surface.…

We define a triangle design as a partition of the set of lines of a projective space into triangles, where a triangle consists of three pairwise intersecting lines with no common point. A triangle design is balanced if all points are…

We prove for the first time that, if a linear inverse problem exhibits a group symmetry structure, gradient-based optimizers can be designed to exploit this structure for faster convergence rates. This theoretical finding demonstrates the…

We study the problem of estimating the number of triangles in a graph stream. No streaming algorithm can get sublinear space on all graphs, so methods in this area bound the space in terms of parameters of the input graph such as the…

This paper aims to show that there exists a triangulation of the Heisenberg group $\mathbb{H}^n$ into singular simplexes with regularity properties on both the low-dimensional and high-dimensional layers. For low dimensions, we request our…

We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in reactive verification; coalgebraic generality implies in particular that we cover not only classical…

We introduce an inference-time scene optimization algorithm utilizing triangle soup, a collection of disconnected translucent triangle primitives, as the representation for the geometry and appearance of a scene. Unlike full-rank Gaussian…