An Algorithm for Convex Polytopes
From MaRDI portal
Publication:5597968
DOI10.1145/321556.321564zbMath0199.50902OpenAlexW1973033359MaRDI QIDQ5597968
Publication date: 1970
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321556.321564
Related Items
An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\), Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points, Faster geometric algorithms via dynamic determinant computation, Robust gift wrapping for the three-dimensional convex hull, Medial axis lookup table and test neighborhood computation for 3D chamfer norms, Geometric containment and vector dominance, Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\), How good are convex hull algorithms?, Partial objective inequalities for the multi-item capacitated lot-sizing problem, Bounds on the complexity of halfspace intersections when the bounded faces have small dimension, Primitives for the manipulation of three-dimensional subdivisions, Three-dimensional unstructured mesh generation. I: Fundamental aspects of triangulation and point creation, Clustering reduced interval data using Hausdorff distance, \(\alpha\)-concave hull, a generalization of convex hull, Voronoi diagrams from convex hulls, A quantum search algorithm of two-dimensional convex hull, Computing the vector in the convex hull of a finite set of points having minimal length, Convex hulls of spheres and convex hulls of disjoint convex polytopes, Certifying algorithms, A new approach to output-sensitive construction of Voronoi diagrams and Delaunay triangulations, Newton polytopes and witness sets, Convex hulls of samples from spherically symmetric distributions, Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling, Small-dimensional linear programming and convex hulls made easy, A new representation and algorithm for constructing convex hulls in higher dimensional spaces, Fuzzy clustering using the convex hull as geometrical model, A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, Identifying genuine clusters in a classification, A new clustering algorithm for coordinate-free data, The complexity of linear programming, A simple algorithm for building the 3-D convex hull, Convex hull properties and algorithms, Extended convex hull, Complexity of methods for approximating convex compact bodies by double description polytopes and complexity bounds for a hyperball, A filtering technique for fast convex hull construction in \(\mathbb{R}^2\), QuickhullDisk: a faster convex hull algorithm for disks, Modélisation et optimisation numérique pour la reconstruction d'un polyèdre à partir de son image gaussienne généralisée, A new variational approach based on level-set function for convex hull problem with outliers, A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions, 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, Least distance methods for the scheme of polytopes, Convex hull of a planar set of straight and circular line segments, An approximate algorithm for computing multidimensional convex hulls, An algorithm for determining redundant inequalities and all solutions to convex polyhedra, Unnamed Item, Higher-dimensional Voronoi diagrams in linear expected time, An Output-Sensitive Convex Hull Algorithm for Planar Objects, Algorithm for determining the reachability set of a linear control system, Quicker than Quickhull
