A fast algorithm for computing one dimensional manifold of a hyperbolic fixed point of a map is presented. The new algorithm uses a variant of the standard approach of iterating a fundamental domain; we prove that parallel computing could be realized by subdividing the local manifold, at the same time, the implementation details are discussed. Curvature constraint and distance control are used to ensue the accuracy and efficiency of the algorithm.