A note on lower bounds for the maximum area and maximum perimeter k-gon problems

https://doi.org/10.1016/0020-0190(89)90022-7Get rights and content

Abstract

An Ω(n log n) lower bound time complexity in the computational tree model for the maximum area and maximum perimeter k-gon problems is demonstrated. The proof uses a reduction to the set-disjointness problem and is based on extremal properties of regular polygons.

References (5)

  • A. Aggarwal et al.

    Geometric applications of a matrix searching algorithm

    Algorithmica

    (1987)
  • M. Ben-Or

    Lower bounds for algebraic computation trees

    Proc. 15th Ann. ACM Symp. on Theory of Computing

    (1983)
There are more references available in the full text version of this article.

Cited by (0)

View full text
Copyright © 1989 Published by Elsevier B.V.