### 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, we propose an efficient algorithm for the two dimensional case and evaluate its time complexity.

Original language | English |
---|---|

Pages (from-to) | 33-40 |

Number of pages | 8 |

Journal | Operations Research Letters |

Volume | 16 |

Issue number | 1 |

DOIs | |

Publication status | Published - 1994 Aug |

Externally published | Yes |

### Keywords

- Computational complexity
- Convex hull
- Minimum norm point

### ASJC Scopus subject areas

- Software
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics

## Fingerprint Dive into the research topics of 'An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane'. Together they form a unique fingerprint.

## Cite this

Makimoto, N., Nakagawa, I., & Tamura, A. (1994). An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane.

*Operations Research Letters*,*16*(1), 33-40. https://doi.org/10.1016/0167-6377(94)90019-1