A case when the union of polytopes is convex


METADATA ONLY
Loading...

Date

2005-03-01

Publication Type

Journal Article

ETH Bibliography

yes

Citations

Altmetric
METADATA ONLY

Data

Rights / License

Abstract

We present a necessary and sufficient condition for the union of a finite number of convex polytopes in ℝd to be convex. This generalises two theorems on convexity of the union of convex polytopes due to Bemporad et al.

Publication status

published

Editor

Book title

Volume

397

Pages / Article No.

381 - 388

Publisher

Elsevier

Event

Edition / version

Methods

Software

Geographic location

Date collected

Date created

Subject

Convex polytopes; Union; Convexity characterization; The colourful Caratheodory theorem

Organisational unit

03391 - Lüthi, Hans-Jakob (emeritus) check_circle
03457 - Welzl, Emo (emeritus) / Welzl, Emo (emeritus) check_circle

Notes

Funding

Related publications and datasets