Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Shanghai Jiaotong University》 2014-05
Add to Favorite Get Latest Update

A Fast Convex Hull Algorithm for Ring-Distributed Planar Point Sets

CHEN Ming;ZHANG Feng;DU Zhen-hong;LIU Ren-yi;Zhejiang Provincial Key Laboratory of GIS,Institute of Geographic Information Science,Zhejiang University;  
Aimed at the problem that the grid-aided algorithm does not perform well in constructing convex hull of a ring-distributed point set,agrid-reprocessing algorithm was proposed.By comparing the spatial relationship between related cells,the proposed algorithm eliminated most of the points never proved to be vertices of the convex hull twice.As a result,the number of points to be Graham-scanned was greatly reduced and the computational efficiency improved.The experimental results show that the grid-reprocessing algorithm significantly improves the efficiency of handling ring-distributed point sets and is more efficient, to a certain extent,than the grid-aided algorithm when dealing with evenly distributed point sets.
【Fund】: 国家自然科学基金(41101356 41171321);; 中央高校基本科研业务费专项基金(2011QNA3008);; 国家海洋公益专项基金(20090512-8)资助项目
【CateGory Index】: TP301.6
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved