【摘要】 目前的曲线压缩方法都损伤曲线形状 ,且压缩后的数据不可解压 (或还原 ) .为了寻求一种不损伤形状 ,能够解压的曲线数据压缩方法 ,用多个函数按最小二乘法对曲线进行识别和分段 ,找出以一定精度最符合曲线或其分段的曲线函数 ,用该函数的参数代替曲线或其分段的顶点坐标 ,实现数据压缩 .用人工曲线、自然曲线以及实际地图分别进行压缩试验 .成功研究了进行曲线压缩时的数据结构 ,压缩和解压算法 .在无形状损伤时 ,压缩比为 1∶5 .83～ 1∶9.8,压缩速度为 5 .5 8～ 5 .98kb s ,解压速度为 35 7.34～84 0 .93kb s .该方法可实现无损压缩 ,压缩效率高 ,解压速度快 .进一步的研究方向是如何解决曲线段连接点的平滑问题 ,实现压缩与平滑同时进行更多还原

【Abstract】 This paper aims at finding a curve data compression method which does not damage the shape of curve, and enables the compressed data to be decompressed. A curve is partitioned by multiple curve functions with least square imitation. The function which is most appropriate for the curve or its partitions with given accuracy is found. The parameters of the function are substituted for vertex coordinates of the curve for the purpose of data compression. Curve compression experiments were made by a new method with artificial, natural curves and practical maps respectively. The curve data structure, compression and decompression algorithms, when the method is used to compress the curve data, are successfully developed. The experimental results are that the compression ratio is 1∶5.83～1∶9.8, the compression speed is 5.58～5.98 kb/s, decompression speed is 357.34～840.93 kb/s, there is no shape damage. It is indicated that the new method features high compression efficiency, quick decompression speed and free from shape damage. The storage and speed effects of the graphic or spatial systems are greatly improved when the method is successfully applied.更多还原