An approximate algorithm for computing multidimensional convex hulls
From MaRDI portal
Publication:1294388
DOI10.1016/S0096-3003(97)10043-1zbMath0941.68140OpenAlexW1968489927MaRDI QIDQ1294388
Yiu-Wing Leung, Jiang-She Zhang, Zong Ben Xu
Publication date: 10 May 2000
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0096-3003(97)10043-1
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items
Sufficient condition for injectivity of NURBS volumes by tangent cones, QuickhullDisk: a faster convex hull algorithm for disks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of d-dimensional Voronoi diagrams
- New trends in discrete and computational geometry
- The complexity of incremental convex hull algorithms in \(R^ d\)
- Extensions of Lemke's algorithm for the linear complementarity problem
- A fast convex hull algorithm
- Linearly constrained estimation by mathematical programming
- An optimal convex hull algorithm in any fixed dimension
- An interior point algorithm for large scale portfolio optimization
- An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane
- Applications of random sampling in computational geometry. II
- An efficient algorithm for determining the convex hull of a finite planar set
- On the identification of the convex hull of a finite set of points in the plane
- A DUAL ALGORITHM FOR FINDING THE MINIMUM-NORM POINT IN A POLYTOPE
- Geometric clusterings
- Finding the convex hull facet by facet
- The Ultimate Planar Convex Hull Algorithm?
- Submodular systems and related topics
- Approximation algorithms for convex hulls
- Statistical Properties of Error Estimators in Performance Assessment of Recognition Systems
- Optimal Search in Planar Subdivisions
- Determining the minimum-area encasing rectangle for an arbitrary closed curve
- Convex hulls of finite sets of points in two and three dimensions
- Finding the nearest point in A polytope
- A New Convex Hull Algorithm for Planar Sets
- Applications of Parametric Searching in Geometric Optimization
- Finding the Point of a Polyhedron Closest to the Origin
- An Algorithm for Convex Polytopes
