How to draw combinatorial maps?
| dc.contributor.author | Zeps, Dainis | |
| dc.contributor.author | Ķikusts, Paulis | |
| dc.date.accessioned | 2013-01-31T13:07:54Z | |
| dc.date.available | 2013-01-31T13:07:54Z | |
| dc.date.issued | 2013-01-31 | |
| dc.description.abstract | In this article we consider the combinatorial map (rendered by permutations) approach to graphs on surfaces and how between both could be establish some terminological uniformity in favor of combinatorial maps in the way rotations were set as fundamental structural elements, and other necessary notions were derived from them. We call this the rotational prevalence with respect to how to build a graph drawing environment. We deal here with simple operations of how to draw combinatorial maps and partial maps. One of our aims would be to advocate a wider use of combinatorial maps in the graph drawing applications. Besides, we advocate to use corners of halfedges where upon permutations act in place of halfedges. | en_US |
| dc.identifier.uri | https://dspace.lu.lv/dspace/handle/7/1336 | |
| dc.language.iso | eng | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.title | How to draw combinatorial maps? | en_US |
| dc.type | Preprint | en_US |