Subpaving

In mathematics, a subpaving is a set of nonoverlapping boxes of R⁺. A subset X of Rⁿ can be approximated by two subpavings X⁻ and X⁺ such that X⁻&thinsp;⊂&thinsp;X&thinsp;⊂&thinsp;X⁺.

In R¹ the boxes are line segments, in R² rectangles and in Rⁿ hyperrectangles. A R² subpaving can be also a "non-regular tiling by rectangles", when it has no holes.



Boxes present the advantage of being very easily manipulated by computers, as they form the heart of interval analysis. Many interval algorithms naturally provide solutions that are regular subpavings.

In computation, a well-known application of subpaving in R² is the Quadtree data structure. In image tracing context and other applications is important to see X⁻ as topological interior, as illustrated.

Example
The three figures on the right below show an approximation of the set  X = {(x1, x2) ∈ R2 | x$2 1$ + x$2 2$ + sin(x1&thinsp;+ x2) ∈ [4,9]} with different accuracies. The set X⁻ corresponds to red boxes and the set X⁺ contains all red and yellow boxes.



Combined with interval-based methods, subpavings are used to approximate the solution set of non-linear problems such as set inversion problems. Subpavings can also be used to prove that a set defined by nonlinear inequalities is path connected, to provide topological properties of such sets, to solve piano-mover's problems or to implement set computation.