A winding number algorithm for closed polygonal paths
Abstract: A winding number algorithm for closed polygonal paths (not necessarily simple) is derived using classical complex analysis results and techniques. The algorithm is designed specifically to handle large cases efficiently. The performance of a computer program based on the algorithm is discussed and compared with the performance of a computer program which obtains the winding number directly by antidifferentiation.
Retrieve articles in Mathematics of Computation with MSC: 65E05
Retrieve articles in all journals with MSC: 65E05
Keywords: Computation of winding numbers, closed polygonal paths, interrogation of algebraic signs, computer program
Article copyright: © Copyright 1973 American Mathematical Society