Mehlhorn, Kurt Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Yap, Chee-Keng Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Mehlhorn, K., & Yap, C.-K. (1991). Constructive Whitney-Graustein Theorem: Or How to Untangle Closed Planar Curves. SIAM Journal on Computing, 20(4), 603-621. doi:10.1137/0220038.