Discrete & Computational Geometry

, Volume 28, Issue 4, pp 585–592 | Cite as

Untangling a Polygon

  • Pach
  • Tardos
Article

Abstract

The following problem was raised by M. Watanabe. Let P be a self-intersecting closed polygon with n vertices in general position. How manys steps does it take to untangle P , i.e., to turn it into a simple polygon, if in each step we can arbitrarily relocate one of its vertices. It is shown that in some cases one has to move all but at most O((n log n)2/3) vertices. On the other hand, every polygon P can be untangled in at most
$$n-\Omega(\sqrt{n})$$
steps. Some related questions are also considered.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York Inc. 2002

Authors and Affiliations

  • Pach
    • 1
  • Tardos
    • 1
  1. 1.Courant Institute, New York University, New York, NY 10012, USA pach@cims.nyu.edu USA

Personalised recommendations