斡泻朴.PDFVIP

Vol.16 No.6 J. Comput. Sci. Technol. Nov. 2001 CIM Algorithm for Approximating Three-Dimensional Polygonal Curves YONG Junhai ( 
), HU Shimin (   ) and SUN Jiaguang (  ) National CAD Engineering Center, Tsinghua University, Beijing 100084, P.R. China Department of Computer Science and Technology, Tsinghua University, Beijing 100084, P.R. China E-mail: shimin@tsinghua.edu.cn Received Novemb er 29, 1999; revised July 17, 2000. Abstract The p olygonal approximation problem is a primary problem in computer graphics, pattern recognition, CAD/CAM, etc. In R 2 , the cone intersection metho d (CIM) is one of the most eÆcient algorithms for approximating p olygonal curves. With CIM Eu and Toussaint, by imp osing an additional constraint and changing the given error criteria, resolve the three-dimensional weighted minimum numb er p olygonal approximation problem with the parallel-strip error criterion (PS-WMN) under L2 norm. In this pap er, without any additional constraint and change of the error criteria, a CIM solution to the same problem with the line segment error criterion (LS-WMN) is presented, which is more frequently encountered than the PS-WMN is. Its time complexity is O (n 3 ), and the space complexity is O (n 2 ). An approxi- mation algorithm is also presented, which takes O (n 2 ) time and O (n ) space. Results of some examples are given to illustrate the eÆciency of these algorithms. Keywords p olygonal curve, CIM, LS-WMN, ap