
Vector Circle Clipping Algorithm Based on Polygon Window of Hexagonal Grid System
Author(s) -
Maoyong Cao,
Heng Zhang,
Changjie Zhou,
Yi Sun,
Hui Yu
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1288/1/012006
Subject(s) - polygon (computer graphics) , window (computing) , cartesian coordinate system , intersection (aeronautics) , grid , algorithm , clipping (morphology) , regular grid , computer science , mathematics , geometry , engineering , aerospace engineering , telecommunications , linguistics , philosophy , frame (networking) , operating system
This paper proposes an algorithm for cropping vector circles in polygon window under hexagonal grid system for the problem of long time consuming and low efficiency of polygon window clipping algorithm in existing Non-Cartesian coordinate system. First, the algorithm converts Cartesian coordinates into hexagonal grid coordinates, then performs intersection detection by vector operation, and uses geometric relations to judge the virtual real intersection points, thus obtaining the coordinates of the real intersection points, and thus cutting the arc results. Finally, the final cropping result is obtained. The experimental results show that the algorithm is an effective vector circle clipping algorithm based on the hexagonal grid system polygon window, and the algorithm has high efficiency and stability.