Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
From MaRDI portal
Publication:2391831
Recommendations
- Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
- A complexity bound on faces of the hull complex
- A bound on the k-gonality of facets of the hypermetric cone and related complexity problems
- An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons.
- An almost optimal bound on the number of intersections of two simple polygons
- Bound on the Multiplicity of Almost Complete Intersections
- Fine-grained complexity theory: conditional lower bounds for computational geometry
- Bounds for the multiplicity of almost complete intersections
- Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
- Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
Cites work
- A complexity bound on faces of the hull complex
- A new polynomial-time algorithm for linear programming
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- A subexponential bound for linear programming
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- An Algorithm for Convex Polytopes
- An optimal convex hull algorithm in any fixed dimension
- Characterization of the distance between subtrees of a tree by the associated tight span
- Computing the bounded subcomplex of an unbounded polyhedron
- Convex Polytopes
- Dimensions of tight spans
- Finding the convex hull facet by facet
- Finding the k Shortest Paths
- Generosity Helps or an 11-Competitive Algorithm for Three Servers
- How good are convex hull algorithms?
- scientific article; zbMATH DE number 3572825 (Why is no real title available?)
- scientific article; zbMATH DE number 3637614 (Why is no real title available?)
- Interior Point Methods for Linear Optimization
- Lectures on Polytopes
- Manhattan orbifolds
- Optimality and Degeneracy in Linear Programming
- Optimally fast incremental Manhattan plane embedding and planar tight span construction
- Polytope pairs and their relationship to linear programming
- Six theorems about injective metric spaces
- Smoothed analysis of algorithms
- Structure of a simple scheduling polyhedron
- The Complexity of Vertex Enumeration Methods
- The maximum numbers of faces of a convex polytope
- The quickhull algorithm for convex hulls
- The upper bound theorem for polytopes: An easy proof of its asymptotic version
- Towards a Genuinely Polynomial Algorithm for Linear Programming
- Trees with Convex Faces and Optimal Angles
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- Tropical convexity
- Voronoi diagrams from convex hulls
- Voronoi drawings of trees
Cited in
(2)
This page was built for publication: Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391831)
