SPATIAL DATABASES

A half-space H in the d-dimensinal space can be defined as the set of points p(x₁, x₂, ... x_d) that satisfy an inequation of de form:

a₁ x₁ + a₂ x₂ + ... + a_d x_d + a_d+1 <= 0

A convex d-dimensional polytope P is defined as the intersection of some finite number of closed half-spaces