conference paper
Computing the writhing number of a polygonal knot
published
yes
Pankaj
Agarwal
author
Herbert
Edelsbrunner
author 3FB178DA-F248-11E8-B48F-1D18A9856A870000-0002-9823-6833
Yusu
Wang
author
SODA: Symposium on Discrete Algorithms
The writhing number measures the global geometry of a closed space curve or knot. We show that this measure is related to the average winding number of its Gauss map. Using this relationship, we give an algorithm for computing the writhing number for a polygonal knot with n edges in time roughly proportional to n(1.6). We also implement a different, simple algorithm and provide experimental evidence for its practical efficiency.
SIAM2002San Francisco, CA, USA
eng
Proceedings of the 13th annual ACM-SIAM symposium on Discrete algorithms
9780898715132
791 - 799
yes
Agarwal P, Edelsbrunner H, Wang Y. 2002. Computing the writhing number of a polygonal knot. Proceedings of the 13th annual ACM-SIAM symposium on Discrete algorithms. SODA: Symposium on Discrete Algorithms, 791–799.
Agarwal, Pankaj, et al. “Computing the Writhing Number of a Polygonal Knot.” <i>Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, SIAM, 2002, pp. 791–99.
Agarwal P, Edelsbrunner H, Wang Y. Computing the writhing number of a polygonal knot. In: <i>Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. SIAM; 2002:791-799.
P. Agarwal, H. Edelsbrunner, and Y. Wang, “Computing the writhing number of a polygonal knot,” in <i>Proceedings of the 13th annual ACM-SIAM symposium on Discrete algorithms</i>, San Francisco, CA, USA, 2002, pp. 791–799.
P. Agarwal, H. Edelsbrunner, Y. Wang, in:, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2002, pp. 791–799.
Agarwal, P., Edelsbrunner, H., & Wang, Y. (2002). Computing the writhing number of a polygonal knot. In <i>Proceedings of the 13th annual ACM-SIAM symposium on Discrete algorithms</i> (pp. 791–799). San Francisco, CA, USA: SIAM.
Agarwal, Pankaj, Herbert Edelsbrunner, and Yusu Wang. “Computing the Writhing Number of a Polygonal Knot.” In <i>Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 791–99. SIAM, 2002.
40032018-12-11T12:06:23Z2023-06-07T13:50:04Z