We introduce a family of combinatorial problems of digital geometry that we call convex aggregation problems. Two variants are considered. In Unary convex aggregation problems, a first lattice set A ⊆ Z d called support and a family of lattice sets B i ⊆ Z d called pads are given. The question to determine whether there exists a non-empty subset of pads (the set of their indices is denoted I) whose union A∪i∈I B i with the support is convex. In the binary convex aggregation problem, the input contains the support set A ⊆ Z 2 and pairs of pads B i and B i. The question is to aggregate to the support either a pad B i or its correspondent B i so that the union A ∪i∈I B i ∪ i ∈I B i is convex. We provide a first classification of the classes of complexities of these two problems in dimension 2 under different assumptions: if the support is 8-connected and the pads included in its enclosing rectangle, if the pads are all disjoint, if they intersect and at least according to the chosen kind of convexity. In the polynomial cases, the algorithms are based on a reduction to Horn-SAT while in the NP-complete cases, we reduce 3-SAT to an instance of convex aggregation.