Developed Algorithm for Making Up Convex Hull Based on Binary Tree

被引：0
|
作者：
Aung, Naing Linn [1 ]
Portnov, Evgeni M. [1 ]
Epishin, Kirill O. [1 ]
机构：
[1] Natl Res Univ Elect Technol MIET, Dept Informat & Comp Software Syst, Moscow, Russia
来源：
2020 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING, APPLICATIONS AND MANUFACTURING (ICIEAM) | 2020年
关键词：
convex hulls; descriptors; binary tree; image; object; points;
D O I：
10.1109/icieam48468.2020.9112046
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
In computer vision, convex hulls are used for pattern recognition and other image analysis using special points. This paper suggests the developed algorithm for making up a convex hull based on a binary tree. The main idea of the algorithm, proposed in this paper, is very similar to the underlying principle incremental algorithm. The new algorithm quite quickly exceeds the running time of the Graham algorithm with a large number of points in the convex hull. This is due to the best complexity of the algorithm. The Graham's algorithm has O(nlogn) complexity when the new algorithm has O(nlogh) average complexity.
引用
收藏
页数：6
相关论文
共 50 条
  • [21] E-ART: A New Encryption Algorithm Based on the Reflection of Binary Search Tree
    Alabdullah, Bayan
    Beloff, Natalia
    White, Martin
    CRYPTOGRAPHY, 2021, 5 (01) : 1 - 15
  • [22] A bit-locking binary tree algorithm based on odd-even zone
    Tang, Hongbin
    Zhou, Shangbo
    Awudu, Karim
    PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON MECHATRONICS AND INDUSTRIAL INFORMATICS, 2015, 31 : 437 - 443
  • [23] Binary tree-based fault location algorithm for optical burst switching network
    Wang R.-Y.
    Liu D.
    Peng H.-J.
    Lv K.-W.
    Optoelectronics Letters, 2009, 5 (4) : 284 - 288
  • [24] Coordinating product configuration in the order fulfilment processing: an approach based on the binary tree algorithm
    Tseng, H. -E.
    Chen, C. -C.
    INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING, 2006, 19 (07) : 716 - 726
  • [25] A fast algorithm to sample the number of vertexes and the area of the random convex hull on the unit square
    Ng, Chi Tim
    Lim, Johan
    Lee, Kyeong Eun
    Yu, Donghyeon
    Choi, Sujung
    COMPUTATIONAL STATISTICS, 2014, 29 (05) : 1187 - 1205
  • [26] An O((log log n)2) time convex hull algorithm on reconfigurable meshes
    Hayashi, T
    Nakano, K
    Olariu, S
    FIRST MERGED INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM & SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, 1998, : 439 - 446
  • [27] AN EFFICIENT AND NUMERICALLY CORRECT ALGORITHM FOR THE 2D CONVEX-HULL PROBLEM
    KAO, TC
    KNOTT, GD
    BIT, 1990, 30 (02): : 311 - 331
  • [28] A LOOPLESS ALGORITHM FOR GENERATING BINARY-TREE SEQUENCES
    VANBARONAIGIEN, DR
    INFORMATION PROCESSING LETTERS, 1991, 39 (04) : 189 - 194
  • [29] Domain extenders for UOWHF: A finite binary tree algorithm
    Sarkar, P
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2005, 11 (06) : 1040 - 1053
  • [30] The Recursive Algorithm of Converting the Forest into the Corresponding Binary Tree
    Wang, Min
    ADVANCED RESEARCH ON COMPUTER SCIENCE AND INFORMATION ENGINEERING, 2011, 153 : 334 - 337
12345