relation: http://eprints.imtlucca.it/571/
title: On convexity recognition of the union of polyhedra
creator: Bemporad, Alberto
creator: Fukuda, Komei
creator: Torrisi, Fabio Danilo
subject: QA Mathematics
description:   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.
date: 2000
type: Conference or Workshop Item
type: PeerReviewed
identifier:   Bemporad, Alberto and Fukuda, Komei and Torrisi, Fabio Danilo  On convexity recognition of the union of polyhedra.  In: International Conference on Advances in Convex Analysis and Global Optimization, June 5-9, 2000, Samos, Greece pp. 64-65.        (2000)