Metric Geometry & Packing

← Back to Domain-Specific Families

Abstractions about scale, covering, and packing in metric and geometric spaces, including scale-uniform space properties (doubling space, dyadic cubes, fat object), dimension and density measures (packing dimension, Hausdorff density), and geometric packing and covering problems (tetrahedron packing, Danzer set, perfect rectangle).

10 abstractions in this family — domain-specific abstractions that sit near one another in structural-signature space (k-means over structural-signature embeddings). Each is shown with its short description.

• Danzer set — A set of points in Euclidean space that intersects every convex body of unit volume, studied through the unresolved question of whether bounded-density examples exist.
• Doubling space — A metric space in which every radius-r ball can be covered by at most a fixed number of radius-r/2 balls, giving a scale-uniform finite doubling dimension.
• Dyadic cubes — A nested multiscale grid of half-open cubes whose side lengths are powers of two, partitioning Euclidean space at each scale and giving every cube a unique parent and finitely many children.
• Fat object (geometry) — A geometric object whose extent is comparable in every direction under a declared fatness criterion, excluding arbitrarily thin or needle-like shapes and enabling stronger algorithmic bounds.
• Gromov's compactness theorem (geometry) — A precompactness theorem for families of compact metric spaces with uniform diameter and covering-number bounds under Gromov–Hausdorff convergence.
• Hausdorff density — The small-scale upper, lower or exact ratio of a Radon measure's mass in balls around a point to the radius raised to a declared dimension.
• Overlap coefficient — A set-similarity measure equal to intersection size divided by the size of the smaller set, reaching one whenever either set contains the other.
• Packing dimension — A fractal dimension defined from the critical exponent of disjoint small-ball packings after a countable-cover regularization.
• Perfect rectangle — A rectangle tiled exactly by finitely many squares whose side lengths are all distinct.
• Tetrahedron packing — The geometric optimization problem of arranging congruent regular tetrahedra without overlapping so as to maximize the fraction of three-dimensional space they occupy.