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

Naoki Makimoto, Ikuo Nakagawa, Akihisa Tamura

Research output: Contribution to journalArticle

3 Citations (Scopus)

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 languageEnglish
Pages (from-to)33-40
Number of pages8
JournalOperations Research Letters
Volume16
Issue number1
DOIs
Publication statusPublished - 1994 Aug
Externally publishedYes

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