On computing the closest boundary point on the convex hull

DOI10.1016/0020-0190(89)90093-8zbMath0682.68038OpenAlexW2036726958MaRDI QIDQ1824383

Alok Aggarwal

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90093-8

zbMATH Keywords

geometric algorithmsoptimal boundsclosest boundary pointthe convex hull

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10) Algorithms in computer science (68W99)

Related Items (1)

An efficient parallel sorting algorithm

Cites Work

• Geometric complexity of some location problems
• Linear Time Algorithms for Two- and Three-Variable Linear Programs
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• The Ultimate Planar Convex Hull Algorithm?

This page was built for publication: On computing the closest boundary point on the convex hull