{"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","author":[{"last_name":"Agarwal","first_name":"Pankaj","full_name":"Agarwal, Pankaj"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"last_name":"Wang","first_name":"Yusu","full_name":"Wang, Yusu"}],"date_created":"2018-12-11T12:06:23Z","oa_version":"None","type":"conference","date_published":"2002-01-01T00:00:00Z","acknowledgement":"NSF under grants CCR-00-86013 and EIA-9972879, NSF under grant CCR-97-12088.","main_file_link":[{"url":"https://dl.acm.org/doi/10.5555/545381.545485"}],"extern":"1","citation":{"mla":"Agarwal, Pankaj, et al. “Computing the Writhing Number of a Polygonal Knot.” *Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms*, SIAM, 2002, pp. 791–99.","ama":"Agarwal P, Edelsbrunner H, Wang Y. Computing the writhing number of a polygonal knot. In: *Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms*. SIAM; 2002:791-799.","ieee":"P. Agarwal, H. Edelsbrunner, and Y. Wang, “Computing the writhing number of a polygonal knot,” in *Proceedings of the 13th annual ACM-SIAM symposium on Discrete algorithms*, San Francisco, CA, USA, 2002, pp. 791–799.","short":"P. Agarwal, H. Edelsbrunner, Y. Wang, in:, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2002, pp. 791–799.","apa":"Agarwal, P., Edelsbrunner, H., & Wang, Y. (2002). Computing the writhing number of a polygonal knot. In *Proceedings of the 13th annual ACM-SIAM symposium on Discrete algorithms* (pp. 791–799). San Francisco, CA, USA: SIAM.","chicago":"Agarwal, Pankaj, Herbert Edelsbrunner, and Yusu Wang. “Computing the Writhing Number of a Polygonal Knot.” In *Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms*, 791–99. SIAM, 2002.","ista":"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."},"_id":"4003","day":"01","conference":{"start_date":"2002-01-06","end_date":"2002-01-08","location":"San Francisco, CA, USA","name":"SODA: Symposium on Discrete Algorithms"},"month":"01","scopus_import":"1","page":"791 - 799","year":"2002","article_processing_charge":"No","abstract":[{"lang":"eng","text":"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."}],"publication":"Proceedings of the 13th annual ACM-SIAM symposium on Discrete algorithms","publist_id":"2125","publisher":"SIAM","quality_controlled":"1","publication_identifier":{"isbn":["9780898715132"]},"title":"Computing the writhing number of a polygonal knot","status":"public","publication_status":"published","language":[{"iso":"eng"}],"date_updated":"2023-06-07T13:50:04Z"}