An approximate algorithm for computing multidimensional convex hulls

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

scientific article; zbMATH DE number 724218
scientific article; zbMATH DE number 123932
A new representation and algorithm for constructing convex hulls in higher dimensional spaces

Cites work

scientific article; zbMATH DE number 4149525 (Why is no real title available?)
scientific article; zbMATH DE number 4032498 (Why is no real title available?)
scientific article; zbMATH DE number 3744430 (Why is no real title available?)
scientific article; zbMATH DE number 43279 (Why is no real title available?)
scientific article; zbMATH DE number 589497 (Why is no real title available?)
scientific article; zbMATH DE number 3436645 (Why is no real title available?)
A DUAL ALGORITHM FOR FINDING THE MINIMUM-NORM POINT IN A POLYTOPE
A New Convex Hull Algorithm for Planar Sets
A fast convex hull algorithm
An Algorithm for Convex Polytopes
An efficient algorithm for determining the convex hull of a finite planar set
An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane
An interior point algorithm for large scale portfolio optimization
An optimal convex hull algorithm in any fixed dimension
Applications of Parametric Searching in Geometric Optimization
Applications of random sampling in computational geometry. II
Approximation algorithms for convex hulls
Convex hulls of finite sets of points in two and three dimensions
Determining the minimum-area encasing rectangle for an arbitrary closed curve
Extensions of Lemke's algorithm for the linear complementarity problem
Finding the Point of a Polyhedron Closest to the Origin
Finding the convex hull facet by facet
Finding the nearest point in A polytope
Geometric clusterings
Linearly constrained estimation by mathematical programming
New trends in discrete and computational geometry
On the complexity of d-dimensional Voronoi diagrams
On the identification of the convex hull of a finite set of points in the plane
Optimal Search in Planar Subdivisions
Statistical Properties of Error Estimators in Performance Assessment of Recognition Systems
Submodular systems and related topics
The Ultimate Planar Convex Hull Algorithm?
The complexity of incremental convex hull algorithms in \(R^ d\)

Cited in

(14)

Towards the computation of the convex hull of a configuration from its corresponding separating matrix
A sublogarithmic convex hull algorithm
QuickhullDisk: a faster convex hull algorithm for disks
scientific article; zbMATH DE number 1755731 (Why is no real title available?)
Inner -approximation of the convex hull of finite sets
On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm
An output sensitive algorithm for discrete convex hulls
Sufficient condition for injectivity of NURBS volumes by tangent cones
Bootstrapping convex hulls
Synergistic solutions for merging and computing planar convex hulls
An algorithm for the construction of convex hulls in simple integer recourse programming
scientific article; zbMATH DE number 4085023 (Why is no real title available?)
Applications of a semi-dynamic convex hull algorithm
Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas

This page was built for publication: An approximate algorithm for computing multidimensional convex hulls

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294388)