Abstract.A ball structure is a triple B = (X, P, B) where X, P are nonempty sets and, for any x ∈ X, α ∈ P , B(x, α) is a subset of X, which is called a ball of radius α around x. It is supposed that x ∈ B(x, α) for any x ∈ X, α ∈ P . A subset Y ⊆ X is called large if X = B(Y, α) for some α ∈ P where B(Y, α) = y∈Y B(y, α). The set X is called a support of B, P is called a set of radiuses. Given a cardinal κ, B is called κ-resolvable if X can be partitioned to κ large subsets. The cardinal res B = sup {κ : B is κ-resolvable} is called a resolvability of B. We determine the resolvability of the ball structures related to metric spaces, groups and filters.2000 AMS Classification: 54A25, 05A18.