In this paper we study a basic problem based on simple bracket manipulations in computational geometry: how to judge if two solid convex polygons or polytopes intersect or not. We will establish a sequence of criteria based on boundary in-tersection searching, hyperplane separation searching and hybrid search method combining the former two systems. Our simulation results show that the latter method is significantly superior to the former criteria.
展开▼
