Mathmatical Model of Truncation Incision in a Plane
Yang Ming · Journal of North China Institute of Technology · 1999
Aim In a plane, we can get a location convex polygon with truncation incision method. Always, the total length varies with the different of cut order. It is the aim of this paper to find the best cut order which can make the total cut length to a minimum. Methods We solve the problem by sorting the cut edges. Results and Conclusion Commonly, the best cut order is ununigue, but the minimal total cut length is unique. One will reach a best cut order and the minmum if he incises these edges by means of methods of theorem 1 and theorem 3 in this paper.