Author:
YURTTAŞ S. ÖYKÜ,HALL TOBY
Abstract
We present an algorithm for calculating the geometric intersection number of two multicurves on the$n$-punctured disk, taking as input their Dynnikov coordinates. The algorithm has complexity$O(m^{2}n^{4})$, where $m$is the sum of the absolute values of the Dynnikov coordinates of the two multicurves. The main ingredient is an algorithm due to Cumplido for relaxing a multicurve.
Publisher
Cambridge University Press (CUP)
Reference10 articles.
1. Ordering Braids
2. On a Yang-Baxter mapping and the Dehornoy ordering;Dynnikov;Uspekhi Mat. Nauk,2002
3. [2] M. Bell and R. Webb , ‘Applications of fast triangulation simplification’, Preprint, 2016, arXiv:1605.03514.
4. Theory of Braids
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献