Is there a data structure that allows one to represent sets of $n$ dimensional rectangles, all orthogonal or parallel to the $x$ axis. efficiently. Allowing all common set operations (union, difference etc) to be done efficiently as well?Let me explain what I mean by a 2D example.Given this two set of rectangles * is the first set % is the second set**************           **       %%%%o%%%%%%*       %   *     %********o ***     %        %         %        %%%%%%%%%%%If I'll do * union %, I can get**************           *********************                 ********************        *         *        ***********or**************           *********************       *   *     ********************        *         *        ***********If I'll do * difference %, I can get**************           ***************       **********Can you refer me to a relevant paper?
Efficiently representing sets of $n$-dimensional rectangles orthogonal an axis
cg.comp geom