Abstract: Based on automatic triangular partitioning of polyhedron mesh, an adaptive remeshing algorithm is put forward. A base mesh, which has the lowest resolution, is first constructed from the triangular partitioning result. Then harmonic mapping is applied to resample the original mesh and recursively refine the base mesh. By proper programming, the resampling procedure generates more points in the region with larger curvature. The proposed algorithm can be used in adaptive triangle mesh simplification and optimization. Practical examples show that the algorithm can generate reasonable remeshing result under given tolerance.