The Minkowski sum of a simple polygon and a segment

  • Authors:

  • Gennady Pustylnik;Micha Sharir

  • Affiliations:

  • School of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel;School of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel and Courant Institute of Mathematical Sciences, New York University, New York, NY

  • Venue:
  • Information Processing Letters
  • Year:
  • 2003

Quantified Score

Hi-index 0.89

Visualization

Abstract

We show that the Minkowski sum of a simple polygon with n edges and a segment has at most 2n - 1 edges, and that this bound is tight in the worst case.