A case when the union of polytopes is convex

DOI10.1016/j.laa.2004.11.018zbMath1072.52007OpenAlexW2066684552MaRDI QIDQ1774983

Imre Bárány, Komei Fukuda

Publication date: 4 May 2005

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2004.11.018

zbMATH Keywords

convex polytopesunionCaratheodory's Theoremconvexity characterization

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Computational aspects related to convexity (52B55) Helly-type theorems and geometric transversal theory (52A35) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (2)

On a cone covering problem ⋮ Exact join detection for convex polyhedra and other numerical abstractions

Cites Work

• Unnamed Item
• A generalization of Caratheodory's theorem
• Convexity recognition of the union of polyhedra

This page was built for publication: A case when the union of polytopes is convex