Amanote Research

Amanote Research

    RegisterSign In

An Algorithm for Winding Numbers for Closed Polygonal Paths

Mathematics of Computation - United States
doi 10.2307/2005574
Full Text
Open PDF
Abstract

Available in full text

Categories
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
Date

April 1, 1975

Authors
Kenneth O. Leland
Publisher

JSTOR


Related search

An Algorithm for Ranking Quickest Simple Paths

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2005English

Rotation and Winding Numbers for Planar Polygons and Curves

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1990English

Size Multipartite Ramsey Numbers for Small Paths Versus Books

Indonesian Journal of Combinatorics
2016English

On Wiener Numbers of Polygonal Nets

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2002English

Newton Polyhedra and an Algorithm for Computing Hodge–deligne Numbers

Mathematics of the USSR-Izvestiya
1987English

On Size Multipartite Ramsey Numbers for Stars Versus Paths and Cycles

Electronic Journal of Graph Theory and Applications
CombinatoricsApplied MathematicsDiscrete Mathematics
2017English

Algorithm Available for Factoring Big Fermat Numbers

Journal of Software
2020English

Majorana Charges, Winding Numbers and Chern Numbers in Quantum Ising Models

Scientific Reports
Multidisciplinary
2017English

An Automatic Arc Length Control Algorithm for Tracing Equilibrium Paths of Nonlinear Structures.

Doboku Gakkai Ronbunshu
1988English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy