On computing the closest boundary point on the convex hull
type: Item
instance of: scholarly article
title: On computing the closest boundary point on the convex hull
zbMATH Open document ID: 0682.68038
DOI: 10.1016/0020-0190(89)90093-8
author: Alok Aggarwal
author: Michael Hawrylycz
published in: Information Processing Letters
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W99
Mathematics Subject Classification ID: 52A10
zbMATH DE Number: 4117841
zbMATH Keywords: geometric algorithms
zbMATH Keywords: optimal bounds
zbMATH Keywords: closest boundary point
zbMATH Keywords: the convex hull
MaRDI profile type: Publication
full work available at URL: 0020-0190(89)90093-8
OpenAlex ID: W2036726958
cites work: Linear Time Algorithms for Two- and Three-Variable Linear Programs
cites work: The Ultimate Planar Convex Hull Algorithm?
cites work: Geometric complexity of some location problems
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
description: scientific article; zbMATH DE number 4117841