Zum Hauptinhalt springen Zur Suche springen Zur Hauptnavigation springen
Herzlich Willkommen!
Convex and discrete geometry is one of the most intuitive subjects in mathematics. One can explain many of its problems, even the most difficult - such as the sphere-packing problem (what is the densest possible arrangement of spheres in an n-dimensional space?) and the Borsuk problem (is it possible to partition any bounded set in an n-dimensional space into n+1 subsets, each of which is strictly smaller in "extent" than the full set?) - in terms that a layman can understand; and one can reasonably make conjectures about their solutions with little training in mathematics.
Autor: Zong, Chuanming
ISBN: 9780387947341
Sprache: Englisch
Seitenzahl: 158
Produktart: Kartoniert / Broschiert
Verlag: Springer US
Veröffentlicht: 25.06.1996
Schlagworte: Area Finite Lattice Lemma Partition Volume approximation boundary element method discrete geometry functions