Abstract: As a general rule ，the Painter’s Algorithm （i．e．the Depth-Sorting Method） is most suitable to remove hidden-surfaces of polyhedrons that have not too much surfaces and those have little overlap in depth．But for moving ones，we found out a method which is based on the Painter’s Algorithm to improve the efficiency of the hidden-surface removing process through eliminating repetitive sorts．Before the method is presented in this paper ，several theorems that the former is based on are stated and proved．