To solve this problem, we can sort the intervals based on their starting points. Then, we can iterate through the sorted intervals and check if the current interval overlaps with the next interval. If it does, we merge them into a single interval. Otherwise, we add the current interval to the merged intervals list.

Here's the Python code to implement this approach:

```
def merge_intervals(intervals):
    intervals = sorted(intervals)  # sort by starting point
    merged = [intervals[0]]
    
    for interval in intervals[1:]:
        if interval[0] <= merged[-1][1]:  # if current interval overlaps with previous
            merged[-1][1] = max(merged[-1][1], interval[1])  # merge them
        else:
            merged.append(interval)  # add current interval to merged list
    
    return merged
```
Given a collection of intervals, merge any overlapping intervals. For example, if the input is [[1,3],[2,6],[8,10],[15,18]], the output should be [[1,6],[8,10],[15,18]].