首页 | 本学科首页   官方微博 | 高级检索  
     

基于HPGL文件的图元优化排序
引用本文:蔡明.基于HPGL文件的图元优化排序[J].计算机系统应用,2013,22(5):203-206.
作者姓名:蔡明
作者单位:暨南大学信息科学与技术学院,广州,510632
基金项目:广东省产学研项目(2011B090400345)
摘    要:HPGL文件的图形元素是以绘图人员设计的先后顺序记录于文件中,导致以此为基础进行的绘图或加工过程的无效行程大量增加且效率低下,且HPGL文件曲线图元均自动插补为大量小线段,以简单查找排序的方法处理耗时长.针对此问题,以HPGL文件记录的图形元素为对象,提出了一种利用哈希思想动态改变图元始末点及图元绘制顺序的优化算法,使其转化为DXF文件图元优化问题,进而实现了HPGL中图形元素及其控制点的优化排序并生成优化后的HPGL文件,使得以此文件为基础的绘图或加工路径得到优化.

关 键 词:HPGL文件  图元  哈希算法  轨迹优化
收稿时间:2013/1/29 0:00:00
修稿时间:2013/3/11 0:00:00

Optimization Sequencing of Graphic Elements Based on HPGL File
CAI Ming.Optimization Sequencing of Graphic Elements Based on HPGL File[J].Computer Systems& Applications,2013,22(5):203-206.
Authors:CAI Ming
Affiliation:School of Information Science and Technology, Jinan University, Guangzhou 510632, China
Abstract:In HPGL file, the graphic elements are recorded according to the sequence made by the designers. A lot of useless journey is made by using the file and it is inefficient in drafting or machining process. In order to solve the problem, an algorithm based on the graphic elements whose start point and endpoint could be dynamically changed Along the drafting path was put forward. The sequence of the graphic elements and its reference points could be optimized by Using the algorithm, the question is converted to DXF, and the drafting or machining path could be reduced based on the optimized HPGL.
Keywords:HPGL file  graphic element  Hash algorithms  optimizing path
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机系统应用》浏览原始摘要信息
点击此处可从《计算机系统应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号