A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems Original Research Article

Determining the cells of an arrangement of hyperplanes is a classical problem in combinatorial geometry. In this paper we present an efficient recursive procedure to solve it.