On computing the closest boundary point on the convex hull

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

Abstract

We observe a somewhat surprising result: Given a set S of n points in E2 and a point q∉S, ⊖(n) time is sufficient to determine a point on the convex hull, CH(S), that is nearest to q when q is exterior to CH(S). However, if q lies in the interior of CH(S), then ⊖(n log n) time is both necessary and sufficient to determine such a point. We also observe that ⊖(n) time suffices to determine whether or not the point q lies inside CH(S).

References (5)

  • M. Kallay

    Convex hull made easy

    Inform. Process. Lett.

    (1986)
  • M.E. Dyer

    Linear time algorithm for two- and three-variable linear programs

    SIAM J. Comput.

    (1984)
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.