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.
인용 양식
Bruno Luong (2024). Interval merging (https://www.mathworks.com/matlabcentral/fileexchange/24254-interval-merging), MATLAB Central File Exchange. 검색됨 .
MATLAB 릴리스 호환 정보
플랫폼 호환성
Windows macOS Linux카테고리
태그
도움
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!