We address the problem of giving a geometric representation to conjunctions of linear constraints with two variables. We show how relevant selection problems for constraint databases can be reduced to point location problems with respect to these representations. These geometric representations can be used as the basis for defining indexing techniques for constraint databases.

