Related papers: Approximation of conformal mappings by circle patt…
In a space-time, a conformal structure is defined by the distribution of light-cones. Geodesics are traced by freely falling particles, and the collection of all unparameterized geodesics determines the projective structure of the…
A novel and deterministic algorithm is presented to detect whether two given rational plane curves are related by means of a similarity, which is a central question in Pattern Recognition. As a by-product it finds all such similarities, and…
Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics, which is for example relevant for tasks like shape interpolation, pose transfer, or texture transfer. An often neglected but essential property…
An occurrence of a classical pattern p in a permutation \pi is a subsequence of \pi whose letters are in the same relative order (of size) as those in p. In an occurrence of a generalized pattern, some letters of that subsequence may be…
We describe a framework for defining high-order image models that can be used in a variety of applications. The approach involves modeling local patterns in a multiscale representation of an image. Local properties of a coarsened image…
The optimal one-sided parametric polynomial approximants of a circular arc are considered. More precisely, the approximant must be entirely in or out of the underlying circle of an arc. The natural restriction to an arc's approximants…
To produce cartographic maps, simplification is typically used to reduce complexity of the map to a legible level. With schematic maps, however, this simplification is pushed far beyond the legibility threshold and is instead constrained by…
Graphs can be associated with a matrix according to some rule and we can find the spectrum of a graph with respect to that matrix. Two graphs are cospectral if they have the same spectrum. Constructions of cospectral graphs help us…
A Tangle is a smooth simple closed curve formed from arcs (or ``links'') of circles with fixed radius. Most previous study of Tangles has dealt with the case where these arcs are quarter-circles, but Tangles comprised of thirds and sixths…
A consistent path system in a graph $G$ is an intersection-closed collection of paths, with exactly one path between any two vertices in $G$. We call $G$ metrizable if every consistent path system in it is the system of geodesic paths…
The uniqueness of the orthogonal Z^\gamma-circle patterns as studied by Bobenko and Agafonov is shown, given the combinatorics and some boundary conditions. Furthermore we study (infinite) rhombic embeddings in the plane which are…
The problem deals with an exact calculation of the intersection area of a circle arbitrary placed on a grid of square shaped elements with gaps between them (finite fill factor). Usually an approximation is used for the calculation of the…
A pair of non-adjacent edges is said to be separated in a circular ordering of vertices, if the endpoints of the two edges do not alternate in the ordering. The circular separation dimension of a graph $G$, denoted by $\pi^\circ(G)$, is the…
A projective rectangle is like a projective plane that may have different lengths in two directions. We develop properties of the graph of lines, in which adjacency means having a common point, especially its strong regularity and clique…
A projective rectangle is like a projective plane that has different lengths in two directions. We develop the basic theory of projective rectangles including incidence properties, projective subplanes, configuration counts, a partial…
The chapter presents mathematical models intended for creating a topological drawing of a non-separable non-planar graph based on the methods of G. Ringel's vertex rotation theory. The induced system of cycles generates a topological…
Graphings are special bounded-degree graphs on probability spaces, representing limits of graph sequences that are convergent in a local or local-global sense. We describe a procedure for turning the underlying space into a compact metric…
We present a procedure to approximate a plane contour by piecewise polynomial functions, depending on various parameters, such as degree, number of local patches, selection of knots. This procedure aims to be adopted to study how…
In this work, we solve the problem of finding non-intersecting paths between points on a plane with a new approach by borrowing ideas from geometric topology, in particular, from the study of polygonal schema in mathematics. We use a…
The Peirce quincuncial projection is a mapping of the surface of a sphere to the interior of a square. It is a conformal map except for four points on the equator. These points of non-conformality cause significant artifacts in photographic…