摘要
该文介绍和研究海量矢量图形在非自交多边形边界中的裁剪显示图形。程序采用快速排斥试验,跨立试验等算法实时高效地计算矢量图形与非矩形且非自交的凸多边形及凹多边形区域的交点,判断图形的哪些部分在多边形边界内部,哪些部分在多边形边界外部,同时能正确显示位于多边形边界内部的图形部分,不显示位于多边形边界外部的图形部分。最终实现当有百万级的line和circle需要裁剪显示时,统计的完成裁剪显示的时间不超过10s,存储器占用不超过100MB的效果。
This article describes and research mass vector graphics in a non-self-intersections polygon boundary clipping in the display graphics. Using of the quick test procedures, straddling the exclusion pilot algorithms such as effective, real-time com- puting vector graphics and non-rectangular and non-cross the convex hull polygon regions, and the intersection of the judgment which parts of the graphics in the polygon boundary in which parts of the inside of the polygon boundary and at the same time to display correctly on the polygon boundary in the graphical part of the internal, do not display on the outside of the polygon boundary Graphical sections. The final realization of the millions of when a line to be cropped and circle displayed, the comple- tion of the statistics displayed in the crop time should not exceed 10s, memory utilization not to exceed 100MB.
作者
李清艳
傅自钢
LI Qing- yan, FU Zi-gang （Hunan Agricultural University Information Institute of Science and Technology, Changsha 410128, China）
出处
《电脑知识与技术》
2015年第11期168-169,共2页
Computer Knowledge and Technology
关键词
非自交多边形
裁剪
算法
海量矢量图形
Non-self-intersections
polygon
clipping
Algorithm,Mass vector graphics
