Related papers: Cutting sequences in Veech surfaces
A separating ($M-2$)-curve is a smooth geometrically irreducible real projective curve $X$ such that $X(\mathbb{R})$ has $g-1$ connected components and $X(\mathbb{C})\setminus X(\mathbb{R})$ is disconnected. Let $T_g$ be a Teichm\"uller…
How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given…
This paper is an introductory and informal exposition on the topology of polygonal meshes. We begin with a broad overview of topological notions and discuss how homeomorphisms, homotopy, and homology can be used to characterise topology. We…
Identifying parallel sides of a collection of Euclidean polygons yields a flat surface with cone points of angles multiples of 2 pi, naturally a compact Riemann surface but also an algebraic curve, and a hyperbolic surface. In general two…
We prove that the enumerative geometry of lines on smooth cubic surfaces is governed by the arithmetic of the base field. In 1949, Segre proved that the number of lines on a smooth cubic surface over any field is 0, 1, 2, 3, 5, 7, 9, 15, or…
Meshes are ubiquitous in visual computing and simulation, yet most existing machine learning techniques represent meshes only indirectly, e.g. as the level set of a scalar field or deformation of a template, or as a disordered triangle soup…
A common representation of a three dimensional object in computer applications, such as graphics and design, is in the form of a triangular mesh. In many instances, individual or groups of triangles in such representation need to satisfy…
A graph $H$ is an \emph{isometric} subgraph of $G$ if $d_H(u,v)= d_G(u,v)$, for every pair~$u,v\in V(H)$. A graph is \emph{distance preserving} if it has an isometric subgraph of every possible order. A graph is \emph{sequentially distance…
The visibility graph of a simple polygon represents visibility relations between its vertices. Knowing the correct order of the vertices around the boundary of a polygon and its visibility graph, it is an open problem to locate the vertices…
A quadrisecant line is one which intersects a curve in at least four points, while an essential secant captures something about the knottedness of a knot. This survey article gives a brief history of these ideas, and shows how they may be…
We present a framework to obtain valid inequalities for a reverse convex set: the set of points in a polyhedron that lie outside a given open convex set. Reverse convex sets arise in many models, including bilevel optimization and…
A (smooth) embedding of a closed curve on the plane with finitely many intersections is said to be generic if each point of self-intersection is crossed exactly twice and at non-tangent angles. A finite word $\omega$ where each character…
The purpose of this paper is to shed a new light on classical constructions in enumerative geometry from the view point of derived algebraic geometry. We first prove that the cosection localized virtual cycle of a quasi-smooth derived…
We introduce Text Encoded Extrusions (TEE), a text-based representation that expresses mesh construction as sequences of face extrusions rather than polygon lists, and a method for generating 3D meshes from TEE using a large language model…
The sliced skein algebra of a closed surface of genus $g$ with $m$ punctures, $\mathfrak{S}=\Sigma_{g,m}$, is the quotient of the Kauffman bracket skein algebra $\mathcal{S}_\xi(\mathfrak{S})$ corresponding to fixing the scalar values of…
A straight line triangle representation (SLTR) of a planar graph is a straight line drawing such that all the faces including the outer face have triangular shape. Such a drawing can be viewed as a tiling of a triangle using triangles with…
We consider skew ruled surfaces in the three-dimensional Euclidean space and some geometrically distinguished families of curves on them whose normal curvature has a concrete form. The aim of this paper is to find and classify all ruled…
We develop a stabilized cut finite element method for the convection problem on a surface based on continuous piecewise linear approximation and gradient jump stabilization terms. The discrete piecewise linear surface cuts through a…
Streamline-based quad meshing algorithms use smooth cross fields to partition surfaces into quadrilateral regions by tracing cross field separatrices. In practice, re-entrant corners and misalignment of singularities lead to small regions…
We introduce a natural notion of depth that applies to individual cutting planes as well as entire families. This depth has nice properties that make it easy to work with theoretically, and we argue that it is a good proxy for the practical…