Eduard Oks

Learn More
Let P be a simple polygon with m edges, which is the disjoint union of k simple polygons , all monotone in a common direction u, and let Q be another simple polygon with n edges, which is the disjoint union of ℓ simple polygons, all monotone in a common direction v. We show that the combinatorial complexity of the Minkowski sum P ⊕ Q is O(kℓmnα(min{m, n})).(More)
  • 1