Algorithmic methods of finite discrete structures. Topological graph drawing (part IV)
By: Sergey Kurapov, Maxim Davidovsky
Potential Business Impact:
Draws complex maps of connected things.
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 drawing of a certain thickness. A method for determining the location of imaginary vertices by finding the intersection of connections on a plane is presented. A topological drawing of a maximum planar subgraph is used as a basis.
Similar Papers
Algorithmic methods of finite discrete structures. Topological graph drawing (part III)
Combinatorics
Draws complex maps for computers to understand.
Characterizing and Recognizing Twistedness
Computational Geometry
Makes drawing lines in a special way easier.
Planar Stories of Graph Drawings: Algorithms and Experiments
Computational Geometry
Keeps map drawings stable while showing less at once.