相关论文: An algorithm to construct one-vertex triangulation…

We present an algorithm for computing the prime factorisation of a knot, which is practical in the following sense: using Regina, we give an implementation that works well for inputs of reasonable size, including prime knots from the…

In this work, we present a general, efficient, and provably robust representation for intrinsic triangulations. These triangulations have emerged as a powerful tool for robust geometry processing of surface meshes, taking a low-quality mesh…

A basic and an improved ear clipping based algorithm for triangulating simple polygons and polygons with holes are presented. In the basic version, the ear with smallest interior angle is always selected to be cut in order to create fewer…

We propose a novel deep reinforcement learning-based approach for 3D object reconstruction from monocular images. Prior works that use mesh representations are template based. Thus, they are limited to the reconstruction of objects that…

We show that if a Heegaard splitting is obtained by gluing a splitting of Hempel distance at least 4 and the genus-1 splitting of $S^2 \times S^1$, then the Goeritz group of the splitting is finitely generated. To show this, we first…

Given a closed hyperbolic 3-manifold $M$, we construct a tower of covers with increasing Heegaard genus, and give an explicit lower bound on the Heegaard genus of such covers as a function of their degree. Using similar methods we prove…

Let M_1 and M_2 be compact, orientable 3-manifolds with incompressible boundary, and M the manifold obtained by gluing with a homeomorphism $\phi:\bdy M_1 \to \bdy M_2$. We analyze the relationship between the sets of low genus Heegaard…

Graph Neural Networks (GNNs) have emerged as the leading paradigm for learning over graph-structured data. However, their performance is limited by issues inherent to graph topology, most notably oversquashing and oversmoothing. Recent…

We establish that a simple polynomial-time algorithm that we call reweighted spectral partitioning obtains small 2/3-balanced vertex-separators for a number of graph classes, including $O(\sqrt{n})$-sized separators for planar graphs,…

In this survey article, we are interested on minimal triangulations of closed pl manifolds. We present a brief survey on the works done in last 25 years on the following: (i) Finding the minimal number of vertices required to triangulate a…

It has been recently shown that any graph of genus g>0 can be stochastically embedded into a distribution over planar graphs, with distortion Olog (g+1)) [Sidiropoulos, FOCS 2010]. This embedding can be computed in polynomial time, provided…

Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…

We give a short proof of a result of Jordan and Tanigawa that a 4-connected graph which has a spanning planar triangulation as a proper subgraph is generically globally rigid in R^3. Our proof is based on a new sufficient condition for the…

We describe an algorithm to construct an intrinsic Delaunay triangulation of a smooth closed submanifold of Euclidean space. Using results established in a companion paper on the stability of Delaunay triangulations on $\delta$-generic…

In a recent paper, {\it Algorithms for Deforming and Contracting Simply Connected Discrete Closed Manifolds (II)}, we discussed two algorithms for deforming and contracting a simply connected discrete closed manifold into a discrete sphere.…

We consider the task of drawing a graph on multiple horizontal layers, where each node is assigned a layer, and each edge connects nodes of different layers. Known algorithms determine the orders of nodes on each layer to minimize crossings…

The hyperbolic random graph model (HRG) has proven useful in the analysis of scale-free networks, which are ubiquitous in many fields, from social network analysis to biology. However, working with this model is algorithmically and…

Haken showed that the Heegaard splittings of reducible 3-manifolds are reducible, that is, a reducing 2-sphere can be found which intersects the Heegaard surface in a single simple closed curve. When the genus of the "interesting" surface…

We give several new perspectives on the Heegaard Floer Dehn surgery formulas of Manolescu, Ozsv\'{a}th and Szab\'{o}. Our main result is a new exact triangle in the Fukaya category of the torus which gives a new proof of these formulas.…

We present a simple combinatorial method to encode 3-dimensional manifolds, based on their Heegaard diagrams. The notion of a Gauss diagram of a 3-manifold is introduced. We check the conditions for a Gauss diagram to represent a closed…