Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.


On Convexity Recognition of the Union of Polyhedra


F.D. Torrisi

International Conference on Advances in Convex Analysis and Global Optimization, Samos, Greece

In this talk we consider the following basic problem in polyhedral computation: Given two polyhedra in $R^d$, $P$ and $Q$, decide whether their union is convex, and eventually compute it. We consider the three natural specializations of the problem: (1) when the polyhedra are given by half-spaces (H-polyhedra) (2) when they are given by vertices and extreme rays (V-polyhedra) (3) when both H- and V-polyhedral representations are available. Both the bounded (polytopes) and the unbounded case are considered. We show that the first two problems are polynomially solvable, and that the third problem is solvable in linear time.


Type of Publication:


File Download:

Request a copy of this publication.
(Uses JavaScript)
% No recipe for automatically generating a BibTex entry for (06)Talk
Permanent link