Abstract: A new algorithm for point/poly.hedron classification which is based on the local feature of the. boundary of the concerned polyhedron is presented. The algorithm is stable and suitable for any kinds of polyhedra represented by bounda ries. The complexity of the algorithm has linear relation with the number of poly gons on the boundary of the interested polyhedrons.