An improved algorithm and implementation for three-dimensional convex hull
A novel and efficient approach for threedimensional convex hull was presented in the paper, comparing with the QuickHull method, the quadratic extremal-point was employed to construct the convex hull in the method, combined with conflict map (Conflict-Graph) of this bipartite graph structure to updated the topological relations between the points outside the convex hull and the current convex hull. This algorithms time complexity is O (nlogr),the experimental results shows that the algorithm is more efficient when compared with the QuickHull method, the average execution time-consuming reduced by 20%).
3D-convex-hull Double extremal point Incremental algorithm
Ruqiong LI Jiahuan ZHANG Huai SHEN
School of Information mechanical and Electronic Engineering Shanghai Normal University, Shanghai China
国际会议
重庆
英文
1-4
2011-12-01(万方平台首次上网日期,不代表论文的发表时间)