The basic algorithm (DDA, midpoint method, Bresenham) to generate the straight line segment of two-d
2016-08-22
1 0 0
no vote
Other
Earn points
The basic algorithm (DDA, midpoint method, Bresenham) for the generation of line segments of two-dimensional basic primitives the basic algorithm (midpoint method) for the generation of Arc / elliptical arc of two-dimensional basic primitives the control of line width attributes the scan line algorithm for the scan conversion of two-dimensional polygons the edge filling algorithm or fence filling algorithm for the scan conversion of two-dimensional polygons the two-dimensional connectivity Scanning line seed filling algorithm of region filling (four or eight connected) Cohen Sutherland clipping algorithm and midpoint segmentation clipping algorithm of two-dimensional line segment clipping, Sutherland Hodgman algorithm and Weiler athenton algorithm of two-dimensional polygon clipping, translation transformation of two-dimensional graphics, scaling transformation of two-dimensional graphics, rotation transformation of two-dimensional graphics, curve and surface generation Component graph generation. - err
java
算法
控制
DDA
bresenham
实现
生成
椭圆
基本
直线
线型
属性
二维
圆弧
中点
图元
Related Source Codes
Android AOA Android Open Accessory Development Usi
0
0
no vote
VPN source code accelerator
0
0
no vote
VPN source code
0
0
no vote
Springboot Campus Recruitment System
0
0
no vote
Java intelligent QR code access control management
0
0
no vote
No comment