Abstract: Boundary searching is a very important problem in computer graphics and CAGD. By analyzing the rules of tracing the path in boundary searching, the mathematical form of corresponding geometric conditions and the relationship between them are represented according to the theory of differential geometry. And then a boundary searching algorithm is given through the comparison of intersect arc length, relative tangent angle, and uniformed curvature. This algorithm completely solves the boundary searching problem.