Campus Event Calendar
Event Entry
What and Who
Convexity of Union of Polytopes
Hansraj Tiwary
Ringvorlesung
AG 1, AG 2, AG 3, AG 4, AG 5
AG Audience
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 9 February 2006
13:00
-- Not specified --
45 - FR 6.2 (E1 3)
016
Saarbrücken
Abstract
A convex polytope is the convex hull of a finite set of points in
euclidean space R^d. Given a finite number of polytopes (each
represented by its vertices) we want to know whether the union of these
polytopes is convex or not. In this talk I will present a theorem by
Barany and Fukuda providing a necessary and sufficient condition for the
union to be convex.
euclidean space R^d. Given a finite number of polytopes (each
represented by its vertices) we want to know whether the union of these
polytopes is convex or not. In this talk I will present a theorem by
Barany and Fukuda providing a necessary and sufficient condition for the
union to be convex.
Contact
--email hidden
passcode not visible
logged in users only
Veronika Weinand, 02/06/2006 16:09
Veronika Weinand, 10/19/2005 13:11
Veronika Weinand, 10/19/2005 13:08 -- Created document.
Veronika Weinand, 10/19/2005 13:11
Veronika Weinand, 10/19/2005 13:08 -- Created document.