UM
A fast convex hull algorithm with maximum inscribed circle affine transformation
Liu R.; Fang B.; Tang Y.Y.; Wen J.; Qian J.
2012-02-01
Source PublicationNeurocomputing
ISSN09252312 18728286
Volume77Issue:1Pages:212-221
AbstractThis paper presents a fast convex hull algorithm for a large point set. The algorithm imitates the procedure of human visual attention derived in a psychological experiment. The merit of human visual attention is to neglect most inner points directly. The proposed algorithm achieves a significant saving in time and space in comparison with the two best convex hull algorithms mentioned in a latest review proposed by Chadnov and Skvortsov in 2004. Furthermore, we propose to use an affine transformation to solve the narrow shape problem for computing the convex hull faster. © 2011 Elsevier B.V.
KeywordAffine transformation Computational geometry Convex hull Point pattern Shape analysis
DOI10.1016/j.neucom.2011.09.011
URLView the original
Language英語
全文获取链接
引用统计
被引频次[WOS]:12   [WOS记录]     [WOS相关记录]
Document TypeJournal article
专题University of Macau
AffiliationChongqing University
推荐引用方式
GB/T 7714
Liu R.,Fang B.,Tang Y.Y.,et al. A fast convex hull algorithm with maximum inscribed circle affine transformation[J]. Neurocomputing,2012,77(1):212-221.
APA Liu R.,Fang B.,Tang Y.Y.,Wen J.,&Qian J..(2012).A fast convex hull algorithm with maximum inscribed circle affine transformation.Neurocomputing,77(1),212-221.
MLA Liu R.,et al."A fast convex hull algorithm with maximum inscribed circle affine transformation".Neurocomputing 77.1(2012):212-221.
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
Google Scholar
中相似的文章 Google Scholar
[Liu R.]的文章
[Fang B.]的文章
[Tang Y.Y.]的文章
Baidu academic
中相似的文章 Baidu academic
[Liu R.]的文章
[Fang B.]的文章
[Tang Y.Y.]的文章
Bing Scholar
中相似的文章 Bing Scholar
[Liu R.]的文章
[Fang B.]的文章
[Tang Y.Y.]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。