Convex hull is one of the important part of computational geometry. Many applications have used this method as part of their system. In this research, the novel Q-scanning of convex hull algorithm is proposed. The algorithm reduces computational complexity of conventional convex hull algorithm. The initial step of the proposed method is dividing the problem of convex hull into four subset hull. Each hull has its extreme point. In the process, the extreme point will move until meet convergence. The proof of the concept is conducted in Matlab software. The method of the experimental setup is a convex construction hull from some finite points of natural number which set randomly. The experiment shows that the algorithm is able to build a convex hull with O(n) of computational complexity and can be used as alternative approach for convex hull problem.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A novel Q-scanning for convex hull algorithm


    Contributors:


    Publication date :

    2015-11-01


    Size :

    226840 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Wiggle hull design having a concave and convex planing hull

    ALMETER JOHN | European Patent Office | 2016

    Free access


    Multivariate Fault Detection with Convex Hull

    Luo, M. / IEEE / AIAA | British Library Conference Proceedings | 2004


    Detecting textured objects using convex hull

    Lu, K. / Pavlidis, T. | British Library Online Contents | 2007


    Spacecraft dynamic energy system based on convex hull algorithm model and use method

    SHEN YANG / JIAO KE / FENG SHUO et al. | European Patent Office | 2023

    Free access