Related papers: Approximation of conformal mappings by circle patt…
The main objective of this study is to understand how geometric hyper-ideal circle patterns can be constructed from given combinatorial angle data. We design a hybrid method consisting of a topological/deformation approach augmented with a…
Compound distributions allow construction of a rich set of distributions. Typically they involve an intractable integral. Here we use a quadrature approximation to that integral to define the quadrature compound family. Special care is…
This paper discusses a more general contractive condition for a class of extended cyclic self-mappings on the union of a finite number of subsets of a metric space which are allowed to have a finite number of successive images in the same…
We use conformal maps to study a free boundary problem for a two-fluid electromechanical system, where the interface between the fluids is determined by the combined effects of electrostatic forces, gravity and surface tension. The free…
A degree-regular triangulation is one in which each vertex has identical degree. Our main result is that any such triangulation of a (possibly non-compact) surface $S$ is geometric, that is, it is combinatorially equivalent to a geodesic…
The development of science has been transforming man's view towards nature for centuries. Observing structures and patterns in an effective approach to discover regularities from data is a key step toward theory-building. With increasingly…
A piecewise constant curvature manifold is a triangulated manifold that is assigned a geometry by specifying lengths of edges and stipulating that for a chosen background geometry (Euclidean, hyperbolic, or spherical), each simplex has an…
If P is a point inside triangle ABC, then the cevians through P extended to the circumcircle of triangle ABC create a figure containing a number of curvilinear triangles. Each curvilinear triangle is bounded by an arc of the circumcircle…
If the universe is finite and smaller than the distance to the surface of last scatter, then the signature of the topology of the universe is writ large on the microwave background sky. We show that the microwave background will be…
Spherical Designs are finite sets of points on the sphere $\mathbb{S}^{d}$ with the property that the average of certain (low-degree) polynomials in these points coincides with the global average of the polynomial on $\mathbb{S}^{d}$. They…
This paper studies circle patterns from the viewpoint of configurations. By using the topological degree theory, we extend the Koebe-Andreev-Thurston Theorem to include circle patterns with obtuse exterior intersection angles. As a…
A map $\varphi:K\to R^2$ of a graph $K$ is approximable by embeddings, if for each $\varepsilon>0$ there is an $\varepsilon$-close to $\varphi$ embedding $f:K\to R^2$. Analogous notions were studied in computer science under the names of…
We provide criteria for deciding whether a given planar curve is an image of a given spatial curve, obtained by a central or a parallel projection with unknown parameters. These criteria reduce the projection problem to a certain…
We study a map matching problem, the task of finding in an embedded graph a path that has low distance to a given curve in R^2. The Fr\'echet distance is a common measure for this problem. Efficient methods exist to compute the best path…
For a graph $G=(V,E),$ a matching $M$ is a set of independent edges. The topic of matchings is well studied in graph theory. In this paper many varieties of matchings are discussed.
Graphs drawn in the plane are ubiquitous, arising from data sets through a variety of methods ranging from GIS analysis to image classification to shape analysis. A fundamental problem in this type of data is comparison: given a set of such…
We present a mathematical and algorithmic scheme for learning the principal geometric elements in an image or 3D object. We build on recent work that convexifies the basic problem of finding a combination of a small number shapes that…
This paper introduces the conformal model (an extension of the homogeneous coordinate system) for molecular geometry, where 3D space is represented within R^5 with an inner product different from the usual one. This model enables efficient…
Let $V$ be a left $R$-module where $R$ is a (not necessarily commutative) ring with unit. The intersection graph $\cG(V)$ of proper $R$-submodules of $V$ is an undirected graph without loops and multiple edges defined as follows: the vertex…
Random graph models are used to describe the complex structure of real-world networks in diverse fields of knowledge. Studying their behavior and fitting properties are still critical challenges, that in general, require model specific…