TY  - CONF
EP  - 65
ID  - eprints571
N2  - 
In this paper 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.
TI  - On convexity recognition of the union of polyhedra
SP  - 64
AV  - none
M2  - Samos, Greece
T2  - International Conference on Advances in Convex Analysis and Global Optimization
Y1  - 2000///
A1  - Bemporad, Alberto
A1  - Fukuda, Komei
A1  - Torrisi, Fabio Danilo
UR  - http://eprints.imtlucca.it/571/
ER  -