How to draw combinatorial map? From graphs and edges to corner rotations and permutations

Dainis Zeps (1) , Paulis Kikusts (1)

1 IMCS - Institute of Mathematics and Computer Science

In this article we consider combinatorial maps approach to graphs on surfaces, and how between them can be establish terminological uniformity in favor of combinatorial maps in way rotations are set as base structural elements and all other notions are derived from them. We set this approach as rotational prevalence principle. We consider simplest way how to draw combinatorial map, and ask how this approach in form of rotational prevalence could be used in graphs drawing practice and wider in algorithms. We try to show in this paper that the use of corners in the place of halfedges is much more natural than that of halfedges. Formally there is no difference between both choices, but corner approach is much more clear and concise, thus we advocate for that.

Mots clés: Combinatorial maps; graph drawing; topological graph theory

Domaines: Mathématiques générales [math.GM]; Combinatoire [math.CO]

Dainis Zeps, Paulis Kikusts. How to draw combinatorial map? From graphs and edges to corner rotations and permutations. 2012. ⟨hal-00720384⟩