A PARTITION ALGORITHM FOR CONSTRUCTING REASONABLE LAYER REPRESENTATION OF CURVED-EDGE POLYGONS
When constructing the layer-representation of curved- edge polygons, some cases were not reasonable. These cases mainly included those where the line from origin to the curved-edges point may have intersected the point with the curved-edge, tangent and self-intersection point. At this time, the curved-edge should be divided. By thorough deep analysis, this paper provides some useful partition algorithms, including the algorithm for finding conic separate points and tangent points, possible self- intersection points for cubic Bezier curves, or different kinds of separate points and tangent points of cubic Bezier curves. These methods can be realized easily and may be used widely accordingly.
Curved-edge polygon Layer-based representation Conic sections Cubic bezier curves
LI Hai-Jun WANG Zheng-Xuan LI Ling
Computer School of Yantai University, Yantai 264005, China Collge of computer science and technology Collge of computer science and technology of jilin University, Changchun 130012, China Computer School of Yantai University, Yantai 264005, China
国际会议
开封
英文
352-358
2006-10-15（万方平台首次上网日期，不代表论文的发表时间）