Abstract: Recently some loop detection methods in surface intersections are presented,but their speed are too slow. In this paper, a concept of bounding convex Pyramid is introduced and the conditions are Proved for guaranteeing that two curves cannot intersect more than one Point. Then new loop detection methods for Bezier curves and surfaces are ProPosed.