eprintid: 468
rev_number: 9
eprint_status: archive
userid: 7
dir: disk0/00/00/04/68
datestamp: 2011-07-27 09:32:44
lastmod: 2014-07-17 12:39:20
status_changed: 2011-07-27 09:32:44
type: article
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: Convexity recognition of the union of polyhedra
ispublished: pub
subjects: QA
divisions: CSA
full_text_status: none
keywords: Polyhedron; Union; Convexity
abstract: In this paper we consider the following basic problem in polyhedral computation: Given two polyhedra in Rd, P and Q, decide whether their union is convex, and, if so, compute it. We consider the three natural specializations of the problem: 1) when the polyhedra are given by halfspaces (H-polyhedra), 2) when they are given by vertices and extreme rays (V-polyhedra), and 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 strongly-polynomially solvable.
date: 2001-04
date_type: published
publication: Computational Geometry
volume: 18
number: 3
publisher: Elsevier
pagerange: 141-154
id_number: 10.1016/S0925-7721(01)00004-9
refereed: TRUE
issn: 0925-7721
official_url: http://www.sciencedirect.com/science/article/pii/S0925772101000049
citation:   Bemporad, Alberto and Fukuda, Komei and Torrisi, Fabio Danilo  Convexity recognition of the union of polyhedra.  Computational Geometry, 18 (3).  pp. 141-154.  ISSN 0925-7721      (2001)