An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane

An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane

0.00 Avg rating—0 Votes
Article ID: iaor19961024
Country: Netherlands
Volume: 16
Issue: 1
Start Page Number: 33
End Page Number: 40
Publication Date: Aug 1994
Journal: Operations Research Letters
Authors: , ,
Abstract:

The minimum norm point problem is to find the minimum norm point in the convex hull of given n points in the d-dimensional Euclidean space. In this note, the authors propose an efficient algorithm for the two dimensional case and evaluate its time complexity.

Reviews

Required fields are marked *. Your email address will not be published.