Related papers: Cutting sequences in Veech surfaces
The degree sequence of a graph is a numerical method to characterize the properties of graphs. Generalized forms of degree sequences exist for complete graphs and complete graphs. Nikolopolus et al. characterized the number of spanning…
We explicitly compute the limiting gap distribution for slopes of saddle connections on the flat surface associated to the regular octagon with opposite sides identified. This is the first such computation where the Veech group of the…
Image tracing is a foundational component of the workflow in graphic design, engineering, and computer animation, linking hand-drawn concept images to collections of smooth curves needed for geometry processing and editing. Even for clean…
Abelian differentials on Riemann surfaces can be seen as translation surfaces, which are flat surfaces with cone-type singularities. Closed geodesics for the associated flat metrics form cylinders whose number under a given maximal length…
Cut-diagrams are diagrammatic objects, defined in dimensions 1 and 2, that generalize links in 3-space and surface-links in 4-space; in dimension 1, this coincides with the theory of welded links. Using cut-diagrams, we introduce an…
The use of skew polynomial rings allows to endow linear codes with cyclic structures which are not cyclic in the classical (commutative) sense. Whenever these skew cyclic structures are carefully chosen, some control over the Hamming…
It is well-known that there exists a bijection between the set of lines of the projective 3-dimensional space $P^3$ and all real points of the so-called Pl\"ucker quadric $\Psi$. Moreover one can identify each point of the Pl\"ucker…
This paper demonstrates that parallel vector curves are piecewise cubic rational curves in 3D piecewise linear vector fields. Parallel vector curves -- loci of points where two vector fields are parallel -- have been widely used to extract…
The celebrated Thue-Morse sequence, or the Prouhet-Thue-Morse sequence (A010060 in the OEIS), has a number of interesting properties and is a rich source to many (counter)examples. We introduce two different square-free sequences on three…
Cut and project sets are obtained by projecting an irrational slice through a lattice to a lower dimensional subspace. Under standard conditions, the resulting pattern has no translational periods even though it retains some regularity of…
Chvatal-Gomory cutting planes (CG-cuts for short) are a fundamental tool in Integer Programming. Given any single CG-cut, one can derive an entire family of CG-cuts, by `iterating' its multiplier vector modulo one. This leads naturally to…
In this note we introduce and define half Cauchy sequences. We prove that a sequence of real numbers is convergent if and only if it is bounded and half Cauchy. We also provide an example of how the concept may be used.
When representing a solid object there are alternatives to the use of traditional explicit (surface meshes) or implicit (zero crossing of implicit functions) methods. Skeletal representations encode shape information in a mixed fashion:…
Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…
Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not incident with the outer face) have degrees larger than three. The planar…
The compression of geometric structures is a relatively new field of data compression. Since about 1995, several articles have dealt with the coding of meshes, using for most of them the following approach: the vertices of the mesh are…
We consider here square tilings of the plane. By extending the formalism introduced in [3] we build a correspondence between plane maps endowed with an harmonic vector and square tilings satisfying a condition of regularity. In the case of…
Feature curves are largely adopted to highlight shape features, such as sharp lines, or to divide surfaces into meaningful segments, like convex or concave regions. Extracting these curves is not sufficient to convey prominent and…
In this work we deal with a symbolic approach to the general quadratic polynomial decomposition. By means of a symbolic implementation, we investigate some properties of the components sequences like orthogonality and symmetry. We present…
We present a new fully automatic block-decomposition hexahedral meshing algorithm capable of producing high quality meshes that strictly preserve feature curve networks on the input surface and align with an input surface cross-field. We…