On a cone covering problem

DOI10.1016/j.comgeo.2010.07.004zbMath1211.68466OpenAlexW2173302337MaRDI QIDQ617540

Hans Raj Tiwary, Khaled M. Elbassioni

Publication date: 21 January 2011

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2010.07.004

zbMATH Keywords

polyhedral conesunionvertex enumerationconvexity testing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Characterization of a topological obstruction to reach control by continuous state feedback ⋮ An obstruction to solvability of the reach control problem using affine feedback ⋮ Spherical coverage verification

Cites Work

• How good are convex hull algorithms?
• A case when the union of polytopes is convex
• On the complexity of four polyhedral set containment problems
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• Lectures on Polytopes
• Identifying the Minimal Transversals of a Hypergraph and Related Problems
• Convexity recognition of the union of polyhedra