Main Page | See live article | Alphabetical index This article is a stub. You can help Wikipedia by fixing it. Discrete geometry or combinatorial geometry may be loosely defined as study of geometrical objects and properties that are discrete or combinatorial, either by their nature or by their representation; the study that does not essentially rely on the notion of continuity. Parts of its domain of research is often attributed to other kinds of geometry: digital geometry, computational geometry. It also overlaps with convex geometry and combinatorial topology. Sample Subjects Combinatorial convexity Polytopes Packing, covering and tiling Kepler's conjecture (Johannes Kepler, 1611): The densest way to pack identical spheres in a given space is the "canonball" arrangement, i.e., in flat layers, with each sphere resting upon three toucning spheres benath it. Triangulation Pick's theorem Geometric set partitioning Geometric set transversals See also: Discrete mathematics, Paul Erdös. This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License.