On computing the closest boundary point on the convex hull
- 19 June 1989
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 31 (6), 311-314
- https://doi.org/10.1016/0020-0190(89)90093-8
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Geometric complexity of some location problemsAlgorithmica, 1986
- Convex hull made easyInformation Processing Letters, 1986
- The Ultimate Planar Convex Hull Algorithm?SIAM Journal on Computing, 1986
- Linear Time Algorithms for Two- and Three-Variable Linear ProgramsSIAM Journal on Computing, 1984
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related ProblemsSIAM Journal on Computing, 1983