On a cone covering problem

DOI10.1016/J.COMGEO.2010.07.004MaRDI QIDQ617540zbMATH OpenOpenAlexFDO

Authors Hans Raj Tiwary, Khaled 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

unionpolyhedral conesvertex enumerationconvexity testing

Mathematics Subject Classification ID

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

Recommendations

• Convexity recognition of the union of polyhedra
• A case when the union of polytopes is convex
• On the complexity of four polyhedral set containment problems
• Transversal hypergraphs and families of polyhedral cones
• On \({\mathbb{K}}^{\Delta}\)

Cites work

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

Cited in

(7)

• scientific article; zbMATH DE number 232520 (Why is no real title available?)
• Convexity recognition of the union of polyhedra
• A criterion for checking if a convex set belongs to the union of a finite number of convex sets
• Spherical coverage verification
• An obstruction to solvability of the reach control problem using affine feedback
• Characterization of a topological obstruction to reach control by continuous state feedback
• Transversal hypergraphs and families of polyhedral cones

This page was built for publication: On a cone covering problem

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