Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\)

DOI10.1016/0898-1221(95)00015-QzbMath0831.90085MaRDI QIDQ1894936

Panos M. Pardalos, William W. Hager, Yong Li

Publication date: 26 July 1995

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

extreme pointsdivide-and-conquerconvex hull problem

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (2)

Boundary modeling in model-based calibration for automotive engines via the vertex representation of the convex hulls ⋮ Considering the attractor structure of chaotic maps for observer-based synchronization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Moment inequalities for random variables in computational geometry
• A fast convex hull algorithm
• Divide and conquer for linear expected time
• An efficient algorithm for determining the convex hull of a finite planar set
• The implementation of an algorithm to find the convex hull of a set of three-dimensional points
• Construction of the convex hull of a finite set of points when the computations are approximate
• The Ultimate Planar Convex Hull Algorithm?
• Linear Programming in Linear Time When the Dimension Is Fixed
• On the convex hull of random points in a polytope
• Determining the minimum-area encasing rectangle for an arbitrary closed curve
• Convex hulls of finite sets of points in two and three dimensions
• On the Average Number of Maxima in a Set of Vectors and Applications
• An Algorithm for Convex Polytopes

This page was built for publication: Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\)