An efficient convex hull algorithm using affine transformation in planar point set

DOI10.1007/s13369-014-1365-3zbMath1327.65040OpenAlexW1998196747MaRDI QIDQ900582

Zhongyang Xiong, Jingpei Dan, Tingping Zhang, Changyuan Xing, Xuegang Wu, Yu-Fang Zhang

Publication date: 22 December 2015

Published in: Arabian Journal for Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13369-014-1365-3

zbMATH Keywords

convex hullcomputational geometryaffine transformationquickhull

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Uses Software

• Qhull

Cites Work

• Approximate polytope ensemble for one-class classification
• A new algorithm for computing the convex hull of a planar point set
• Convex hull properties and algorithms
• Another efficient algorithm for convex hulls in two dimensions
• Optimal output-sensitive convex hull algorithms in two and three dimensions
• An efficient algorithm for determining the convex hull of a finite planar set
• On the identification of the convex hull of a finite set of points in the plane
• Self-improving algorithms for coordinate-wise maxima
• The quickhull algorithm for convex hulls
• Image registration and object recognition using affine invariants and convex hulls

This page was built for publication: An efficient convex hull algorithm using affine transformation in planar point set