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.
Zitieren als
Bruno Luong (2024). Interval merging (https://www.mathworks.com/matlabcentral/fileexchange/24254-interval-merging), MATLAB Central File Exchange. Abgerufen .
Kompatibilität der MATLAB-Version
Plattform-Kompatibilität
Windows macOS LinuxKategorien
Tags
Quellenangaben
Inspiriert: Range intersection
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Live Editor erkunden
Erstellen Sie Skripte mit Code, Ausgabe und formatiertem Text in einem einzigen ausführbaren Dokument.
IntervalOps/
Version | Veröffentlicht | Versionshinweise | |
---|---|---|---|
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 |