Geodesics are used widely in computer graphics and other field. MMP is a sophisticated method while geodesics are calculated on triangular meshes. We achieved a precision geodesics algorithm based on MMP
and modified the error which occurred when adopting the Vitaly Surazhsky’s method. At the window propagating
lamp-house-radial method was used instead of using an approximate type. In dealing with window intersection
the complex and multiplex sorts were treated with layered enumerate type. A clear and comprehensible algorithm used in backtracing. At last
the result was presented
the run time is little more than Vitaly Surazhsky’s to some exerd