Finding the convex hull facet by facet
From MaRDI portal
Publication:3677173
DOI10.1016/0196-6774(85)90017-3zbMath0563.68041OpenAlexW2079789648MaRDI QIDQ3677173
Publication date: 1985
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(85)90017-3
algorithmconvex hullcomputational geometryboundary pointsfacet enumerationcombinatorial equivalence problemfacial lattice of a d-dimensional polytope
Related Items
Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points, Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces, Capturing the essence of a metabolic network: a flux balance analysis approach, Robust gift wrapping for the three-dimensional convex hull, On the complexity of some basic problems in computational convexity. I. Containment problems, Enumerating trichromatic triangles containing the origin in linear time, How good are convex hull algorithms?, Segments in enumerating faces, Bounds on the complexity of halfspace intersections when the bounded faces have small dimension, On the numerical solution of the equation \(\frac{\partial ^ 2z\partial ^ 2z}{\partial x^ 2\partial y^ 2}-(\frac{\partial ^ 2z}{\partial x\partial y})^ 2=f\) and its discretizations. I, Computing the vector in the convex hull of a finite set of points having minimal length, A new approach to output-sensitive construction of Voronoi diagrams and Delaunay triangulations, The Fermat-Steiner-Weber-problem in Minkowski spaces, FINDING SIMPLICES CONTAINING THE ORIGIN IN TWO AND THREE DIMENSIONS, Small-dimensional linear programming and convex hulls made easy, (Deterministic) algorithms that compute the volume of polytopes, A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes, A linear-time algorithm to compute the triangular hull of a digital object, Generating all vertices of a polyhedron is hard, Optimal output-sensitive convex hull algorithms in two and three dimensions, Output-sensitive results on convex hulls, extreme points, and related problems, Computational complexity of norm-maximization, An approximate algorithm for computing multidimensional convex hulls, Classification of eight-dimensional perfect forms, Higher-dimensional Voronoi diagrams in linear expected time, Efficient enumeration of the vertices of polyhedra associated with network LP's, An Output-Sensitive Convex Hull Algorithm for Planar Objects
