Ioannis Emiris -- Volume computation of convex regions
–
23 November 2017
Volume computation of convex regions
Ioannis Emiris (NKU Athens)
The major part of this talk is devoted to sampling methods for convex polytopes. Our main contribution is the development in C++ of a practical method for dimensions in the hundreds, by geometric random walks, following the popular paradigm of Hit-and-Run. We show that worst-case bounds are overly pessimistic. This approach is readily extended to convex regions. We then examine certain structured inputs: We implement efficient methods for sampling simplices as well as formulae for the volume of the intersection of a simplex and one or more halfspaces.
Joint work with Vissarion Fisikopoulos (Oracle, Greece)
Salle Byron Blanc (Y106), Inria
Ioannis Emiris -- Volume computation of convex regions
–
23 November 2017
Volume computation of convex regions
Ioannis Emiris (NKU Athens)
The major part of this talk is devoted to sampling methods for convex polytopes. Our main contribution is the development in C++ of a practical method for dimensions in the hundreds, by geometric random walks, following the popular paradigm of Hit-and-Run. We show that worst-case bounds are overly pessimistic. This approach is readily extended to convex regions. We then examine certain structured inputs: We implement efficient methods for sampling simplices as well as formulae for the volume of the intersection of a simplex and one or more halfspaces.
Joint work with Vissarion Fisikopoulos (Oracle, Greece)
Salle Byron Blanc (Y106), Inria
Soon available
