Clipping Algorithm of Vector Graphics in Nonself-Crossing Polygons
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    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.

    Reference
    Related
    Cited by
Get Citation

康耀龙,冯丽露,张景安,朱媛媛.矢量图形在非自交多边形中的裁剪算法.计算机系统应用,2018,27(11):231-235

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:March 23,2018
  • Revised:April 23,2018
  • Adopted:
  • Online: October 24,2018
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063