Related papers: Drawing maps on oriented surfaces
We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…
We introduce a model that learns to convert simple hand drawings into graphics programs written in a subset of \LaTeX. The model combines techniques from deep learning and program synthesis. We learn a convolutional neural network that…
There exists a variety of coloring problems for plane graphs, involving vertices, edges, and faces in all possible combinations. For instance, in the \emph{entire coloring} of a plane graph we are to color these three sets so that any pair…
A rooted planar map is a connected graph embedded in the 2-sphere, with one edge marked and assigned an orientation. A term of the pure lambda calculus is said to be linear if every variable is used exactly once, normal if it contains no…
If a graph $G_M$ is embedded into a closed surface $S$ such that $S \backslash G_M$ is a collection of disjoint open discs, then $M=(G_M,S)$ is called a {\em map}. A {\em zigzag} in a map $M$ is a closed path which alternates choosing, at…
In a planar confluent orthogonal drawing (PCOD) of a directed graph (digraph) vertices are drawn as points in the plane and edges as orthogonal polylines starting with a vertical segment and ending with a horizontal segment. Edges may…
This note wants to explain how to obtain meaningful pictures of (possibly high-dimensional) convex polytopes, triangulated manifolds, and other objects from the realm of geometric combinatorics such as tight spans of finite metric spaces…
An efficient computer algorithm is described for the perspective drawing of a wide class of surfaces. The class includes surfaces corresponding lo single-valued, continuous functions which are defined over rectangular domains. The algorithm…
A branched covering map of surfaces induces a map in the opposite direction between their arc complexes. We represent a branched covering map combinatorially using what we call a lifting picture, and use this representation to computably…
We consider embeddings of planar graphs in $R^2$ where vertices map to points and edges map to polylines. We refer to such an embedding as a polyline drawing, and ask how few bends are required to form such a drawing for an arbitrary planar…
We consider the problem of drawing an outerplanar graph with $n$ vertices with at most one bend per edge if the outer face is already drawn as a simple polygon. We prove that it can be decided in $O(nm)$ time if such a drawing exists, where…
A regular map is a surface together with an embedded graph, having properties similar to those of the surface and graph of a platonic solid. We analyze regular maps with reflection symmetry and a graph of density strictly exceeding 1/2, and…
A planar graph can be embedded in a piecewise linear manifold, and the lattice on each linear piece can be colored with 3-coloring. If a planar graph can be colored with multiple 3-coloring, i.e. coloring the graph in pieces with different…
For cubic pencils we define the notion of an involution curve. This is a curve which intersects each curve of the pencil in exactly one non-base point of the pencil. Involution curves can be used to construct integrable maps of the plane…
Multi-Angled Parallelism (MAP) is a method to recognize lines in binary images. It is suitable to be implemented in parallel processing and image processing hardware. The binary image is transformed into directional planes, upon which,…
There are numerous styles of planar graph drawings, notably straight-line drawings, poly-line drawings, orthogonal graph drawings and visibility representations. In this note, we show that many of these drawings can be transformed from one…
Modern methods of graph theory describe a graph up to isomorphism, which makes it difficult to create mathematical models for visualizing graph drawings on a plane. The topological drawing of the planar part of a graph allows representing…
A map is a partition of the sphere into regions that are labeled as countries or holes. The vertices of a map graph are the countries of a map. There is an edge if and only if the countries are adjacent and meet in at least one point. For a…
Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…
The MAP model was introduced in information system engineering in order to model processes on a flexible way. The intentional level of this model helps an engineer to execute a process with a strong relationship to the situation of the…