A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Drawing bobbin lace graphs, or, Fundamental cycles for a subclass of periodic graphs
[article]
2017
arXiv
pre-print
In this paper, we study a class of graph drawings that arise from bobbin lace patterns. The drawings are periodic and require a combinatorial embedding with specific properties which we outline and demonstrate can be verified in linear time. In addition, a lace graph drawing has a topological requirement: it contains a set of non-contractible directed cycles which must be homotopic to (1,0), that is, when drawn on a torus, each cycle wraps once around the minor meridian axis and zero times
arXiv:1708.09778v3
fatcat:utdfdpswdjbctpbrfwax7hus2y