Interval merging

Merging intervals in the bracket form
2.3K Downloads
Updated Tue, 23 Apr 2013 17:54:29 +0000

View License

A handily simple function for a merging task:

Given N input closed intervals in bracket form:
Ii := [left(i),right(i)], i = 1,2...,N (mathematical notation).

The set union{Ii) can be written as a canonical partition by intervals Jk; i.e., union{Ii) = union(Jk), where Jk are M intervals (with M<=N, so the partition is minimum cardinal), and {Jk} are disjoint to each other (their intersections are empty).

This function returns Jk = [lower(k),upper(k)], k=1,2,...M, in the ascending sorted order.

Cite As

Bruno Luong (2024). Interval merging (https://www.mathworks.com/matlabcentral/fileexchange/24254-interval-merging), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2009a
Compatible with any release
Platform Compatibility
Windows macOS Linux
Acknowledgements

Inspired: Range intersection

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Version Published Release Notes
1.2.0.0

Simplified engine for RangeIntersection

1.1.0.0

New feature, intersection of a set of interval-unions

1.0.0.0