Before revision: This paper proposes a new method which approximates a classification function separating a d dimensional compact set into two parts . The approach starts by estimating the intersection between the classification boundary and the edges of a regular grid covering the compact set .
After revision: This paper proposes a new method which approximates a classification function separating a d dimensional compact set into two parts , and an efficient algorithm classifying points according to this approximation. In a first variant, the approximation is made of simplices that are defined in the cubes of a regular grid covering the compact set .