###
计算机系统应用:2018,27(11):231-235
←前一篇   |   后一篇→
本文二维码信息
码上扫一扫!
矢量图形在非自交多边形中的裁剪算法
康耀龙1, 冯丽露2, 张景安3, 朱媛媛2
(1.山西大同大学 数学与计算机科学学院, 大同 037009;2.山西大同大学 教育科学与技术学院, 大同 037009;3.山西大同大学 网络信息中心, 大同 037009)
Clipping Algorithm of Vector Graphics in Nonself-Crossing Polygons
KANG Yao-Long1, FENG Li-Lu2, ZHANG Jing-An3, ZHU Yuan-Yuan2
(1.School of Mathematics and Computer Science, Shanxi Datong University, Datong 037009, China;2.School of Education Science and Technology, Shanxi Datong University, Datong 037009, China;3.Network Information Center, Shanxi Datong University, Datong 037009, China)
摘要
图/表
参考文献
相似文献
本文已被:浏览 42次   下载 39
投稿时间:2018-03-23    修订日期:2018-04-23
中文摘要: 计算机图形学中裁剪算法的效率会直接影响到图形计算、处理、显示的速度和用户体验.本文在Java环境下,围绕降低循环中冗余计算、重用对象、多线程控制等方面,对传统的矢量图裁剪算法进行改进.改进后的算法在执行效率和内存消耗上均优于传统的矢量图裁剪算法.该算法的应用可以有效的提高工程图形的生成效率.
中文关键词: 非自交多边形  矢量图形  裁剪
Abstract:Efficiency of the clipping algorithm in computer graphics will directly affect the graphics computing, processing, display speed, and user experience. Around the redundant computing, reuse of objects, multithreading control, etc. in the reducing cycle, this study improved traditional vector clipping algorithms in Java environment. This improved algorithm is superior to the traditional vector graphics clipping algorithm in terms of execution efficiency and memory consumption. The application of proposed algorithm can effectively improve the efficiency of engineering graphics generation.
文章编号:     中图分类号:    文献标志码:
基金项目:山西大同大学科研项目(2015K2);山西省教育科学“十二五”规划课题(GH-14023);大同市软科学研究计划(2016135);山西大同大学青年科学研究项目(2015Q20)
引用文本:
康耀龙,冯丽露,张景安,朱媛媛.矢量图形在非自交多边形中的裁剪算法.计算机系统应用,2018,27(11):231-235
KANG Yao-Long,FENG Li-Lu,ZHANG Jing-An,ZHU Yuan-Yuan.Clipping Algorithm of Vector Graphics in Nonself-Crossing Polygons.COMPUTER SYSTEMS APPLICATIONS,2018,27(11):231-235

用微信扫一扫

用微信扫一扫