On 2/21/07, Pierre-Charles D. firstname.lastname@example.org wrote:
FWIW, people working with temporal logics and event algebras define 13
possible relationships between two intervals (see Fig. 4 page 10 of
), with a precise (if not always intuitive) vocabulary.
Very interesting. As it happens I was thinking about algorithms for
intervals just this morning, for a personal project of mine. Do you
any more resources you could share on this topic?
In particular I’m looking for the most straightforward way to
set of intervals such that the resulting set is composed of the smallest
number of non-contiguous, non-overlapping intervals that encompass all
the starting intervals. E.g.:
|---| |---| |------|
Any insight you could provide would be much appreciated.