Results 11 to 20 of about 115,388 (320)
Ceylon Journal of Science, 2021 The definition of the convex hull of a set of points is the smallest convex set containing all the points. Many algorithms have been proposed with the worst case time complexity is equal to O (n log n).
K. R. Wijeweera, S. R. Kodituwakku
doaj +1 more source
Estimating 3D Green Volume and Aboveground Biomass of Urban Forest Trees by UAV-Lidar
Remote Sensing, 2022 Three dimensional (3D) green volume is an important tree factor used in forest surveys as a prerequisite for estimating aboveground biomass (AGB). In this study, we developed a method for accurately calculating the 3D green volume of single trees from ...
Lv Zhou +7 more
doaj +1 more source
AN EFFICIENT ALGORITHM FOR THE CONVEX HULL OF PLANAR SCATTERED POINT SET [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2012 Computing the convex hull of a point set is requirement in the GIS applications. This paper studies on the problem of minimum convex hull and presents an improved algorithm for the minimum convex hull of planar scattered point set.
Z. Fu, Y. Lu
doaj +1 more source
Reverse Furthest Neighbor Query Method Based on Improved Metric Index [PDF]
Jisuanji gongcheng, 2017 When using PIV algorithm to build a Metric index,it is needed to calculate the distance between the convex hull vertices and all the data points in the convex hull.When the data set is large,this wastes storage space and increases the consumption of ...
YANG Xiujuan,DONG Jun,LI Huihui,YUAN Yanzhong,CHEN Xiaodan
doaj +1 more source
Applied Sciences, 2021 Procambarus clarkii was found to have excellent anti-wear performance against abrasive materials. To improve the wear resistance performance of the soil-engaging component of agricultural machinery, in this study, the micro-thorn and convex hull coupled ...
Qingzhu Zhang +4 more
doaj +1 more source
Dynamic planar convex hull [PDF]
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 2003 In this article, we determine the amortized computational complexity of the planar dynamic convex hull problem by querying. We present a data structure that maintains a set of n points in the plane under the insertion and deletion of points in amortized O(log n) time per operation. The space usage of the data structure is O(n).
Jacob, Riko, Brodal, Gerth Stølting
openaire +2 more sources
PENGKLASIFIKASIAN DEBITUR DENGAN MENGGUNAKAN ALGORITMA GRAHAM SCAN DALAM PENGAPLIKASIAN CONVEX HULL
E-Jurnal Matematika, 2013 Computational geometry is the mathematical science of computation by using the algorithm analysis to solve the problems of geometry. The problems of computational include polygon triangulations, convex hulls, Voronoi diagrams, and motion planning. Convex
AGUS EKA ARIESTA +3 more
doaj +1 more source
Largest convex hulls for convex-hull disjoint clusters with bounded size
Theoretical Computer Science, 2023 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tan, Xuehou, Chen, Rong
openaire +1 more source
Recognition and localization method of occluded apples based on K-means clustering segmentation algorithm and convex hull theory [PDF]
智慧农业, 2019 Accurate segmentation and localization of apple objects in natural scenes is an important part of wisdom agriculture research for information perception and acquisition.
Jiang Mei, Sun Sashuang, He Dongjian, Song Huaibo
doaj +1 more source