Judging the Intersection of Convex Polygons by Bracket Method

摘要：

　　In this paper,we study a basic problem based on bracket manipulations in computational geometry:how to judge if two solid convex polygons intersect or not.A key idea in our criteria is that the signs of some brackets of the homogeneous coordinates of the vertices of the two convex bodies are all we need in carrying out the judgment.Experiments show that the uniformity of representation by bracket is significant and efficient in practical computation.

关键词： Bracket Computer graphics Convex polygons Intersection

作者: Ying Chen Yaogang Du

作者单位: Department of Basic Sciences Beijing Electronic Science and Technology Institute Beijing, P.R.China

会议类型: 国际会议

会议名称: 2012 2nd International Conference on Computer Application and System Modeling(2012第二届计算机应用与系统建模国际会议)(ICCASM-2012)

会议地点: 沈阳

会议语种:英文

页码: 1312-1314

在线出版日期: 2012-07-27（万方平台首次上网日期，不代表论文的发表时间）