Related papers: Making Multicurves Cross Minimally on Surfaces

Charts are oriented labeled graphs in a disk. Any simple surface braid (2-dimensional braid) can be described by using a chart. Also, a chart represents an oriented closed surface embedded in 4-space. In this paper, we investigate embedded…

We investigate the relationship between finite groups and incidence geometries through their automorphism structures. Building upon classical results on the realizability of groups as automorphism groups of graphs, we develop a general…

For a locally finite, connected graph $\Gamma$, let $\operatorname{Map}(\Gamma)$ denote the group of proper homotopy equivalences of $\Gamma$ up to proper homotopy. Excluding sporadic cases, we show $\operatorname{Aut}(S(M_\Gamma)) \cong…

The algorithm of Gutwenger et al. to insert an edge $e$ in linear time into a planar graph $G$ with a minimal number of crossings on $e$, is a helpful tool for designing heuristics that minimize edge crossings in drawings of general graphs.…

Let $\Sigma$ be a surface with boundary $b(\Sigma)$, $\mathcal{L}$ be a collection of $k$ disjoint $b(\Sigma)$-paths in $\Sigma$, and $P$ be a non-separating $b(\Sigma)$-path in $\Sigma$. We prove that there is a homeomorphism $\phi: \Sigma…

We prove that a planar $C^2$-regular boundary $\Gamma$ can always be parameterized with its closest point projection $\pi$ over a certain collection of edges $\Gamma_h$ in an ambient triangulation, by making simple assumptions on the…

This paper introduces the $(\alpha, \Gamma)$-descent, an iterative algorithm which operates on measures and performs $\alpha$-divergence minimisation in a Bayesian framework. This gradient-based procedure extends the commonly-used…

Let $\Gamma$ be a triangulation of a connected closed $2$-dimensional (not necessarily orientable) surface. Using zigzags (closed left-right paths), for every face of $\Gamma$ we define the $z$-monodromy which acts on the oriented edges of…

Given a $C^1$ function $\mathcal{H}$ defined in the unit sphere $\mathbb{S}^2$, an $\mathcal{H}$-surface $M$ is a surface in the Euclidean space $\mathbb{R}^3$ whose mean curvature $H_M$ satisfies $H_M(p)=\mathcal{H}(N_p)$, $p\in M$, where…

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…

We construct a Riemannian metric $g$ on $\mathbb{R}^4$ (arbitrarily close to the euclidean one) and a smooth simple closed curve $\Gamma\subset \mathbb R^4$ such that the unique area minimizing surface spanned by $\Gamma$ has infinite…

A quadrangular embedding of a graph in a surface $\Sigma$, also known as a quadrangulation of $\Sigma$, is a cellular embedding in which every face is bounded by a $4$-cycle. A quadrangulation of $\Sigma$ is minimal if there is no…

Motivated by recent work on Delaunay triangulations of hyperbolic surfaces, we consider the minimal number of vertices of such triangulations. First, we will show that every hyperbolic surface of genus $g$ has a simplicial Delaunay…

We study partitions on three dimensional manifolds which minimize the total geodesic perimeter. We propose a relaxed framework based on a $\Gamma$-convergence result and we show some numerical results. We compare our results to those…

We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors.…

Motivated by geometry processing for surfaces with non-trivial topology, we study discrete harmonic maps between closed surfaces of genus at least two. Harmonic maps provide a natural framework for comparing surfaces by minimizing…

Establishing dense correspondence across 3D shapes is crucial for fundamental downstream tasks, including texture transfer, shape interpolation, and robotic manipulation. However, learning these mappings without manual supervision remains a…

Computing the diameter of the intersection graphs of objects is a basic problem in computational geometry. Previous works showed that the complexity of computing the diameter mainly depends on the object types: for unit disks and squares in…

Given a surface $\Sigma$ equipped with a set $P$ of marked points, we consider the triangulations of $\Sigma$ with vertex set $P$. The flip-graph of $\Sigma$ whose vertices are these triangulations, and whose edges correspond to flipping…

Let $S$ be a surface of negative Euler characteristic and consider a finite filling collection $\Gamma$ of closed curves on $S$ in minimal position. An observation of Foulon and Hasselblatt shows that $PT(S) \setminus \hat{\Gamma}$ is a…