Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

A winding number algorithm for closed polygonal paths
HTML articles powered by AMS MathViewer

by J. V. Petty PDF
Math. Comp. 27 (1973), 333-337 Request permission

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.
References
  • Walter Rudin, Real and complex analysis, McGraw-Hill Book Co., New York-Toronto, Ont.-London, 1966. MR 0210528
    • A. E. Taylor, Advanced Calculus, Ginn, New York, 1955.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65E05
  • Retrieve articles in all journals with MSC: 65E05
Additional Information
  • © Copyright 1973 American Mathematical Society
  • Journal: Math. Comp. 27 (1973), 333-337
  • MSC: Primary 65E05
  • DOI: https://doi.org/10.1090/S0025-5718-1973-0329216-1
  • MathSciNet review: 0329216