Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\)
type: Item
instance of: scholarly article
title: Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\)
zbMATH Open document ID: 0831.90085
DOI: 10.1016/0898-1221(95)00015-Q
author: Panos M. Pardalos
author: William Hager
author: Yong Li
publication date: 1995-07-26T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 779200
zbMATH Keywords: extreme points
zbMATH Keywords: divide-and-conquer
zbMATH Keywords: convex hull problem
MaRDI profile type: Publication
cites work: A fast convex hull algorithm
cites work: On the Average Number of Maxima in a Set of Vectors and Applications
cites work: Divide and conquer for linear expected time
cites work: An efficient algorithm for determining the convex hull of a finite planar set
cites work: Q4323618
cites work: Determining the minimum-area encasing rectangle for an arbitrary closed curve
cites work: The Ultimate Planar Convex Hull Algorithm?
cites work: Linear Programming in Linear Time When the Dimension Is Fixed
cites work: An Algorithm for Convex Polytopes
cites work: Construction of the convex hull of a finite set of points when the computations are approximate
cites work: Q4079613
cites work: The implementation of an algorithm to find the convex hull of a set of three-dimensional points
cites work: Moment inequalities for random variables in computational geometry
cites work: On the convex hull of random points in a polytope
cites work: Q3992847
cites work: Convex hulls of finite sets of points in two and three dimensions
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 779200