### 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 |

Externally published | Yes |

### Fingerprint

### Keywords

- Computational complexity
- Convex hull
- Minimum norm point

### ASJC Scopus subject areas

- Management Science and Operations Research
- Statistics, Probability and Uncertainty
- Discrete Mathematics and Combinatorics
- Modelling and Simulation

### Cite this

*Operations Research Letters*,

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

**An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane.** / Makimoto, Naoki; Nakagawa, Ikuo; Tamura, Akihisa.

Research output: Contribution to journal › Article

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

}

TY - JOUR

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

AU - Makimoto, Naoki

AU - Nakagawa, Ikuo

AU - Tamura, Akihisa

PY - 1994

Y1 - 1994

N2 - 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.

AB - 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.

KW - Computational complexity

KW - Convex hull

KW - Minimum norm point

UR - http://www.scopus.com/inward/record.url?scp=0004705467&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0004705467&partnerID=8YFLogxK

U2 - 10.1016/0167-6377(94)90019-1

DO - 10.1016/0167-6377(94)90019-1

M3 - Article

AN - SCOPUS:0004705467

VL - 16

SP - 33

EP - 40

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 1

ER -