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
Externally publishedYes

Fingerprint

Convex Hull
Point Sets
Finite Set
Efficient Algorithms
Norm
Time Complexity
Euclidean space
Evaluate
Convex hull

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

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.

In: Operations Research Letters, Vol. 16, No. 1, 1994, p. 33-40.

Research output: Contribution to journalArticle

@article{315d771764c34202a6eeb441070d9a2b,
title = "An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane",
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.",
keywords = "Computational complexity, Convex hull, Minimum norm point",
author = "Naoki Makimoto and Ikuo Nakagawa and Akihisa Tamura",
year = "1994",
doi = "10.1016/0167-6377(94)90019-1",
language = "English",
volume = "16",
pages = "33--40",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "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 -