Largest placement of one convex polygon inside another

Published

Journal Article

We show that the largest similar copy of a convex polygon P with m edges inside a convex polygon Q with n edges can be computed in O(mn2 log n) time. We also show that the combinatorial complexity of the space of all similar copies of P inside Q is O(mn2), and that it can also be computed in O(mn2 log n) time.

Full Text

Duke Authors

Cited Authors

  • Agarwal, PK; Amenta, N; Sharir, M

Published Date

  • January 1, 1998

Published In

Volume / Issue

  • 19 / 1

Start / End Page

  • 95 - 104

International Standard Serial Number (ISSN)

  • 0179-5376

Digital Object Identifier (DOI)

  • 10.1007/PL00009337

Citation Source

  • Scopus