Algorithms for polytope covering and approximation

DOI10.1007/3-540-57155-8_252MaRDI QIDQ5060117zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Kenneth L. Clarkson

Publication date 18 January 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57155-8_252

Mathematics Subject Classification ID

Randomized algorithms (68W20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Computational aspects related to convexity (52B55)

Recommendations

• Small-dimensional linear programming and convex hulls made easy
• A combinatorial bound for linear programming and related problems
• Las Vegas algorithms for linear and integer programming when the dimension is small
• On the convex hull of random points in a polytope
• A subexponential bound for linear programming

Cites work

• scientific article; zbMATH DE number 742976 (Why is no real title available?)
• New applications of random sampling in computational geometry
• Reporting points in halfspaces
• -nets and simplex range queries

Cited in

(38)

• On separating points by lines
• On some polyhedra covering problems
• A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces
• Hausdorff approximation of 3D convex polytopes
• Computing instance-optimal kernels in two dimensions
• On the VC-dimension of unique round-trip shortest path systems
• Sparse convex hull coverage
• Economical convex coverings and applications
• An algorithm of polynomial order for computing the covering dimension of a finite space
• Approximate polytope membership queries
• On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
• Covering a simplex by spheres: complexity and algorithms
• On the geometric interpretation of the nonnegative rank
• Polytope approximation and the Mahler volume
• Almost optimal set covers in finite VC-dimension
• About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces
• Universal guard problems
• An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries
• More dynamic data structures for geometric set cover with sublinear update time
• On the complexity of approximating and illuminating three-dimensional convex polyhedra
• Polyhedral circuits and their applications
• The parameterized complexity of guarding almost convex polygons
• Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space
• Algorithms of optimal set covering on the planar R^2
• Sparse Approximation via Generating Point Sets
• Helly-type theorems for approximate covering
• On the combinatorial complexity of approximating polytopes
• scientific article; zbMATH DE number 7662168 (Why is no real title available?)
• Parameterized Analysis of Art Gallery and Terrain Guarding
• Algorithms for the frame of a finitely generated unbounded polyhedron
• Angle covers: algorithms and complexity
• Guarding galleries and terrains
• scientific article; zbMATH DE number 1057736 (Why is no real title available?)
• On Approximating the Depth and Related Problems
• Near-linear algorithms for geometric hitting sets and set covers
• Linear time approximation of 3D convex polytopes
• Dynamic geometric set cover, revisited
• On approximating the depth and related problems

This page was built for publication: Algorithms for polytope covering and approximation

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