|
1 |
Hitting and Covering Affine Families of Convex Polyhedra, with Applications to Robust Optimization
Cardinal, Jean. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
2 |
Morse–Smale complexes on convex polyhedra
Enthalten in Periodica mathematica Hungarica 5.6.2024: 1-22
|
|
|
|
3 |
Finding Closed Quasigeodesics on Convex Polyhedra
Demaine, Erik D.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
|
|
|
|
4 |
Improving interpolants of non-convex polyhedra with linear arithmetic and probably approximatley correct learning for bounded linear arrangements
Beber, Björn. - Mainz : Universitätsbibliothek Mainz, 2018
|
|
|
|
5 |
A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions
Chan, Timothy M.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2015
|
|
|
|
6 |
Algorithmen zur Bestimmung der Struktur konvexer Hüllen und der Eckenmenge von Polyedern: Eine vergleichende probabilistische Analyse
Wörle, Thomas. - Augsburg : Universität Augsburg, 2012
|
|
|
|
7 |
Correction to: On the Approximation of Unbounded Convex Sets by Polyhedra
Enthalten in Journal of optimization theory and applications Bd. 194, 19.5.2022, Nr. 1, date:7.2022: 288-289
|
|
|
|
8 |
On the Approximation of Unbounded Convex Sets by Polyhedra
Enthalten in Journal of optimization theory and applications Bd. 194, 29.3.2022, Nr. 1, date:7.2022: 265-287
|
|
Administration
