<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2000-11-14 11:05:02Polytopes Video game development Collision detection Bounding volume Convex geometry Sweep and prune Minimum bounding box Ming C. Lin Convex polytope Geometry 3D computer graphics Computational physics |
| POLYTOPES ET POINTS ENTIERS par Olivier Debarre Table des mati` eresDocID: 1xTFr - View Document |
| Fano varieties and polytopes Olivier DEBARRE ————— The Fano Conference —————DocID: 1xTmK - View Document |
| Sorting and a Tale of Two Polytopes Jean Cardinal ULB, Brussels, Belgium Algorithms & Permutations, Paris, 2012DocID: 1uPKr - View Document |
| SUM OF SQUARES CERTIFICATES FOR CONTAINMENT OF H-POLYTOPES IN V-POLYTOPES KAI KELLNER AND THORSTEN THEOBALD Abstract. Given an H-polytope P and a V-polytope Q, the decision problem whether P is contained in Q is co-NP-coDocID: 1sIuk - View Document |
| Some 0/1 polytopes need exponential size extended formulations Thomas Rothvoß Department of Mathematics, M.I.T. 0/1 polytopesDocID: 1sBpi - View Document |