Paper on red-black interval trees

["Nate Hayes" <nh@xxxxxxxxxxxxxxxxx>]

P1788,

I've been using red-black binary search trees in my private work, and I 
recently came accross the attached paper on red-black interval trees.

FWIW, the spatial sorting argorithm described therein relies on interval 
relations, namely those interval relations recently voted on in Motion 
13.04. See, e.g., Figure 2 of the attached paper (as well as the relevant 
pseudo-code definitions) which depict:

   -- The "precedes-or-touches" relation: (a) and (b)

   -- The "less-or-equal" relation: (c1) and (c2)

   -- The "subset-or-equal" relation: (c3) and (c4)

Regards,

Nate Hayes

Attachment: 08d_1.pdf
Description: Adobe PDF document