eprintid: 571
rev_number: 10
eprint_status: archive
userid: 7
dir: disk0/00/00/05/71
datestamp: 2011-07-27 09:11:28
lastmod: 2014-07-17 12:18:14
status_changed: 2011-07-27 09:11:27
type: conference_item
metadata_visibility: show
item_issues_count: 0
creators_name: Bemporad, Alberto
creators_name: Fukuda, Komei
creators_name: Torrisi, Fabio Danilo
creators_id: alberto.bemporad@imtlucca.it
creators_id: 
creators_id: 
title: On convexity recognition of the union of polyhedra
ispublished: pub
subjects: QA
divisions: CSA
full_text_status: none
pres_type: paper
abstract: 
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
publication: Proc. Int. Conf. on Advances in Convex Analysis and Global Optimization
pagerange: 64-65
event_title: International Conference on Advances in Convex Analysis and Global Optimization
event_location: Samos, Greece
event_dates: June 5-9, 2000
event_type: conference
refereed: TRUE
book_title: Proc. Int. Conf. on Advances in Convex Analysis and Global Optimization
related_url_url: http://control.ee.ethz.ch/index.cgi?action=details&id=330&page=publications
citation:   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)