Computing the writhing number of a polygonal knot

P. Agarwal, H. Edelsbrunner, Y. Wang, in:, SIAM, 2002, pp. 791–799.

Download
No fulltext has been uploaded. References only!
Conference Paper | Published
Author
; ;
Abstract
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.
Publishing Year
Date Published
2002-01-01
Acknowledgement
NSF under grants CCR-00-86013 and EIA-9972879, NSF under grant CCR-97-12088.
Page
791 - 799
Conference
SODA: Symposium on Discrete Algorithms
IST-REx-ID

Cite this

Agarwal P, Edelsbrunner H, Wang Y. Computing the writhing number of a polygonal knot. In: SIAM; 2002:791-799.
Agarwal, P., Edelsbrunner, H., & Wang, Y. (2002). Computing the writhing number of a polygonal knot (pp. 791–799). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.
Agarwal, Pankaj, Herbert Edelsbrunner, and Yusu Wang. “Computing the Writhing Number of a Polygonal Knot,” 791–99. SIAM, 2002.
P. Agarwal, H. Edelsbrunner, and Y. Wang, “Computing the writhing number of a polygonal knot,” presented at the SODA: Symposium on Discrete Algorithms, 2002, pp. 791–799.
Agarwal P, Edelsbrunner H, Wang Y. 2002. Computing the writhing number of a polygonal knot. SODA: Symposium on Discrete Algorithms 791–799.
Agarwal, Pankaj, et al. Computing the Writhing Number of a Polygonal Knot. SIAM, 2002, pp. 791–99.

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar