To compute the convex hull of a set of points using a divide-and-conquer approach, we can outline the process in pseudocode and then implement it in C++. The divide-and-conquer algorithm generally includes these steps:
1. **Divide**: Split the set of points into two halves.
2. **Conquer**: Recursively compute the convex hull for each half.
3. **Combine**: Merge the two convex hulls into a single convex hull.
###