Related papers: Drawing maps on oriented surfaces
Fan-planar graphs were recently introduced as a generalization of 1-planar graphs. A graph is fan-planar if it can be embedded in the plane, such that each edge that is crossed more than once, is crossed by a bundle of two or more edges…
This paper presents a novel on-line path planning method that enables aerial robots to interact with surfaces. We present a solution to the problem of finding trajectories that drive a robot towards a surface and move along it. Triangular…
It is proposed a new code for contours of plane images. This code was applied for optical character recognition of printed and handwritten characters. One can apply it to recognition of any visual images.
We describe a practical algorithm to compute the (oriented) genus of a graph, give results of the program implementing this algorithm, and compare the performance to existing algorithms. The aim of this algorithm is to be fast enough for…
Many problems can be presented in an abstract form through a wide range of binary objects and relations which are defined over problem domain. In these problems, graphical demonstration of defined binary objects and solutions is the most…
We consider upward-planar layered drawings of directed graphs, i.e., crossing-free drawings in which each edge is drawn as a y-monotone curve going upward from its tail to its head, and the y-coordinates of the vertices are integers. The…
A lamination of a graph embedded on a surface is a collection of pairwise disjoint non-contractible simple closed curves drawn on the graph. In the case when the surface is a sphere with three punctures (a.k.a. a pair of pants), we first…
We construct 9-parameter and 13-parameter dynamical systems of the plane which map bi-quadratic curves to other bi-quadratic curves and return to the original curve after two iterations. These generalize the QRT maps which map each such…
A rectangular drawing of a planar graph $G$ is a planar drawing of $G$ in which vertices are mapped to grid points, edges are mapped to horizontal and vertical straight-line segments, and faces are drawn as rectangles. Sometimes this latter…
We derive two types of linearity conditions for mapping class groups of orientable surfaces: one for once-punctured surface, and the other for closed surface, respectively. For the once-punctured case, the condition is described in terms of…
Embedding diagrams have been used extensively to visualize the properties of curved space in Relativity. We introduce a new kind of embedding diagram based on the {\it extrinsic} curvature (instead of the intrinsic curvature). Such an…
Density-equalizing map is a shape deformation technique originally developed for cartogram creation and sociological data visualization on planar geographical maps. In recent years, there has been an increasing interest in developing…
A visualized graph is a powerful tool for data analysis and synthesis tasks. In this case, the task of visualization constitutes not only in displaying vertices and edges according to the graph representation, but also in ensuring that the…
We introduce the $k$-Plane Insertion into Plane drawing ($k$-PIP) problem: given a plane drawing of a planar graph $G$ and a set $F$ of edges, insert the edges in $F$ into the drawing such that the resulting drawing is $k$-plane. In this…
We compute the distance-dependent three-point function of general planar maps and of bipartite planar maps, i.e., the generating function of these maps with three marked vertices at prescribed pairwise distances. Explicit expressions are…
We present probabilistic neural programs, a framework for program induction that permits flexible specification of both a computational model and inference algorithm while simultaneously enabling the use of deep neural networks.…
While many algorithms exist for tracing various contours for illustrating a meshed object, few algorithms organize these contours into region-bounding closed loops. Tracing closed-loop boundaries on a mesh can be problematic due to…
We present a necessary and sufficient condition for existence of a contractible Hamiltonian Cycle in the edge graph of equivelar maps on surfaces. We also present an algorithm to construct such cycles. This is further generalized and shown…
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…
A technique is described for constructing three-dimensional vector graphics representations of planar regions bounded by cubic B\'ezier curves, such as smooth glyphs. It relies on a novel algorithm for compactly partitioning planar B\'ezier…