<--- Back to Details
First PageDocument Content
Polytopes / 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
Date: 2000-11-14 11:05:02
Polytopes
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

Add to Reading List

Source URL: www.cs.jhu.edu

Download Document from Source Website

File Size: 350,91 KB

Share Document on Facebook

Similar Documents

Hausdorff School: Economics and Tropical Geometry Bonn, May 9-13, 2016 Discrete Convex Analysis III: Algorithms for Discrete Convex Functions Kazuo Murota

DocID: 1v6lO - View Document

Hausdorff School: Economics and Tropical Geometry Bonn, May 9-13, 2016 Discrete Convex Analysis I: Concepts of Discrete Convex Functions Kazuo Murota

DocID: 1uq8J - View Document

Hausdorff School: Economics and Tropical Geometry Bonn, May 9-13, 2016 Discrete Convex Analysis II: Properties of Discrete Convex Functions Kazuo Murota

DocID: 1uci8 - View Document

Geometry / Euclidean geometry / Convex geometry / Cubes / Space-filling polyhedra / Volume / Zonohedra

Simplot_FinalLogo_FullColor

DocID: 1rprR - View Document

Geometry / Mathematics / Space / Convex geometry / Linear programming / Operations research / Polytopes / Polyhedral combinatorics / Hirsch conjecture / KleeMinty cube / Simplex algorithm / Convex polytope

75 Documenta Math. Who Solved the Hirsch Conjecture? ยจ nter M. Ziegler

DocID: 1rnGl - View Document