Related papers: Cutting sequences in Veech surfaces

For a finite dimensional vector space G we define the k-th generic syzygy scheme Gensyz_k(G) by explicit equations. We show that the syzygy scheme Syz(f) of any syzygy in the linear strand of a projective variety X which is cut out by…

In a previous paper the author introduced the notion of TreadmillSled of a curve, which is an operator that takes regular curves in R^2 to curves in R^2. This operator turned out to be very useful to describe helicoidal surfaces, for…

We study the generalization of split, k-branch split, and intersection cuts from Mixed Integer Linear Programming to the realm of Mixed Integer Nonlinear Programming. Constructing such cuts requires calculating the convex hull of the…

Distance measuring is a very important task in digital geometry and digital image processing. Due to our natural approach to geometry we think of the set of points that are equally far from a given point as a Euclidean circle. Using the…

Impossible objects, geometric constructions that humans can perceive but that cannot exist in real life, have been a topic of intrigue in visual arts, perception, and graphics, yet no satisfying computer representation of such objects…

Physical modeling method, represented by simulation and visualization of the principles in physics, is introduced in the shape extraction of the active contours. The objectives of adopting this concept are to address the several major…

The set of relevant cuts in a graph is the union of all minimum weight bases of the cut space. A cut is relevant if and only if it is the a minimum weight cut between two distinct vertices. Moreover, we give a characterization in terms of…

We study the relationship between the areas of the consecutive quadrilaterals cut from a convex quadrilateral in the plane by means of a finite or infinite number of straight lines intersecting two of its opposite sides. Moreover, we obtain…

Here we have introduced the idea of rough Cauchyness of sequences in a cone metric space. Also here we have discussed several basic properties of rough Cauchy sequences in a cone metric space using the idea of Phu.

A symbolic method for solving linear recurrences of combinatorial and statistical interest is introduced. This method essentially relies on a representation of polynomial sequences as moments of a symbol that looks as the framework of a…

An orthogonal drawing is an embedding of a plane graph into a grid. In a seminal work of Tamassia (SIAM Journal on Computing 1987), a simple combinatorial characterization of angle assignments that can be realized as bend-free orthogonal…

A Lagrangian-type numerical scheme called the "comoving mesh method" or CMM is developed for numerically solving certain classes of moving boundary problems which include, for example, the classical Hele-Shaw flow problem and the well-known…

Sketching is a dimensionality reduction technique where one compresses a matrix by linear combinations that are chosen at random. A line of work has shown how to sketch the Hessian to speed up each iteration in a second order method, but…

We study collections of curves in generic position on a closed surface whose complement consists of one disk only, up to orientation-preserving homeomorphism of the surface. We define a surgery operation on the set of such collections and…

The stated skein algebra of a punctured bordered surface (or equivalently, a marked surface) is a generalization of the well-known Kauffman bracket skein algebra of unmarked surfaces and can be considered as an extension of the quantum…

A pseudorandom number generator is widely used in cryptography. A cryptographic pseudorandom number generator is required to generate pseudorandom numbers which have good statistical properties as well as unpredictability. An m-sequence is…

Subdivision schemes are iterative methods for the design of smooth curves and surfaces. Any linear subdivision scheme can be identified by a sequence of Laurent polynomials, also called subdivision symbols, which describe the linear rules…

We present an intuitionistic interpretation of Euler-Venn diagrams with respect to Heyting algebras. In contrast to classical Euler-Venn diagrams, we treat shaded and missing zones differently, to have diagrammatic representations of…

If V is the vertex sequence of a symmetric 2t-cycle in the hypercube graph with the vertices {1,-1}^t, then for any vertex T of the graph there exists a unique inclusion-minimal subset of V such that T is the sum of its elements. We present…

In this article, we present a graph-based method using a cubic template for volumetric segmentation of vertebrae in magnetic resonance imaging (MRI) acquisitions. The user can define the degree of deviation from a regular cube via a…