Related papers: Cutting sequences in Veech surfaces

Trimming is a core technique in geometric modeling. Unfortunately, the resulting objects do not take the requirements of numerical simulations into account and yield various problems. This paper outlines principal issues of trimmed models…

In computer-aided design (CAD), the ability to "reverse engineer" the modeling steps used to create 3D shapes is a long-sought-after goal. This process can be decomposed into two sub-problems: converting an input mesh or point cloud into a…

For a smooth projective curve, the cycles of subordinate or, more generally, secant divisors to a given linear series are among some of the most studied objects in classical enumerative geometry. We consider the intersection of two such…

In this paper we study sequences of vector orthogonal polynomials. The vector orthogonality presented here provides a reinterpretation of what is known in the literature as matrix orthogonality. These systems of orthogonal polynomials…

Vector fields are a highly abstract physical concept that is often taught using visualizations. Although vector representations are particularly suitable for visualizing quantitative data, they are often confusing, especially when…

Symmetry handling inequalities (SHIs) are a popular tool to handle symmetries in integer programming. Despite their successful application in practice, only little is known about the interaction of SHIs with optimization problems. In this…

Polygons are cycles embedded into the plane; their vertices are associated with $x$- and $y$-coordinates and the edges are straight lines. Here, we consider a set of polygons with pairwise non-overlapping interior that may touch along their…

The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent…

Generalized M\"obius-Listing bodies and surfaces are generalizations of the classic M\"obius band. The original motivation is that for solutions of boundary value problems the knowledge of the domain is essential. In previous papers cutting…

Boundaries on spatial fields divide regions with particular features from surrounding background areas. These boundaries are often described with contour lines. To measure and record these boundaries, contours are often represented as…

The $k$-cut complex was recently introduced by Bayer et al. as a generalization of earlier work of Fr{\"o}berg (1990) and Eagon and Reiner (1998), and was shown to be shellable for several classes of graphs. In this article, we prove that…

Language models can perceive visual properties of text despite receiving only sequences of tokens-we mechanistically investigate how Claude 3.5 Haiku accomplishes one such task: linebreaking in fixed-width text. We find that character…

Motivated by Elementary Problem B-1172 in the Fibonacci Quarterly (vol. 53, no. 3, pg. 273), formulas for the areas of triangles and other polygons having vertices with coordinates taken from various sequences of integers are obtained. The…

The Fr\'echet distance is a computational mainstay for comparing polygonal curves. The Fr\'echet distance under translation, which is a translation invariant version, considers the similarity of two curves independent of their location in…

In technology mapping, enumeration of subcircuits or cuts to be replaced by a standard cell is an important step that decides both the quality of the solution and execution speed. In this work, we view cuts as set of edges instead of as set…

All rational parametric curves with prescribed polynomial tangent direction form a vector space. Via tangent directions with rational norm, this includes the important case of rational Pythagorean hodograph curves. We study vector subspaces…

We study the algebraic and geometric properties of stated skein algebras of surfaces with punctured boundary. We prove that the skein algebra of the bigon is isomorphic to the quantum group ${\mathcal O}_{q^2}(\mathrm{SL}(2))$ providing a…

A convex polygon is defined as a sequence (V_0,...,V_{n-1}) of points on a plane such that the union of the edges [V_0,V_1],..., [V_{n-2},V_{n-1}], [V_{n-1},V_0] coincides with the boundary of the convex hull of the set of vertices…

A grid polygon is a polygon whose vertices are points of a grid. We define an injective map between permutations of length n and a subset of grid polygons on n vertices, which we call consecutive-minima polygons. By the kernel method, we…

In this paper we develop the theory of Willmore sequences for Willmore surfaces in the 4-sphere. We show that under appropriate conditions this sequence has to terminate. In this case the Willmore surface either is the twistor projection of…