Thumbnail
Access Restriction
Subscribed

Author Xing, Changyuan ♦ Xiong, Zhongyang ♦ Zhang, Yufang ♦ Wu, Xuegang ♦ Dan, Jingpei ♦ Zhang, Tingping
Source SpringerLink
Content type Text
Publisher Springer Berlin Heidelberg
File Format PDF
Copyright Year ©2014
Language English
Subject Domain (in DDC) Technology ♦ Engineering & allied operations
Subject Keyword Computational geometry ♦ Convex hull ♦ Quickhull ♦ Affine transformation ♦ Engineering ♦ Science
Abstract When trying to find the convex hull (CH) of a point set, humans can neglect most non-vertex points by an initial estimation of the boundary of the point set easily. The proposed CH algorithm imitates this characteristic of visual attention, starts by constructing an initial convex polygon (ICP), and measures the width and length of ICP through a shape estimation step. It then maps the point set into the new one by an affine transformation and makes most of the new points exist in a new initial convex polygon (NICP) which approximated to a regular convex polygon. Next, it discards the interior points in NICP by an inscribed circle and processes the remaining points outside NICP by Quickhull. Finally, the algorithm outputs the vertex set of CH. Two theorems are also proposed to solve an unconstrained optimization problem instead of the iteration method. Compared with four popular CH algorithms, the proposed algorithm can generate CH much faster than them and achieve a better performance.
ISSN 13198025
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2014-08-28
Publisher Place Berlin, Heidelberg
e-ISSN 21914281
Journal Arabian Journal for Science and Engineering
Volume Number 39
Issue Number 11
Page Count 9
Starting Page 7785
Ending Page 7793


Open content in new tab

   Open content in new tab
Source: SpringerLink