Results 1 to 10 of about 12,323 (117)

Preprocessing 2D data for fast convex hull computations. [PDF]

PLoS One, 2019
This paper presents a method to reduce a set of n 2D points to a smaller set of s 2D points with the property that the convex hull on the smaller set is the same as the convex hull of the original bigger set.
Cadenas O, Megson GM.
europepmc   +2 more sources

Preconditioning 2D Integer Data for Fast Convex Hull Computations. [PDF]

PLoS One, 2016
In order to accelerate computing the convex hull on a set of n points, a heuristic procedure is often applied to reduce the number of points to a set of s points, s ≤ n, which also contains the same hull.
Cadenas JO, Megson GM, Luengo Hendriks CL.   +2 more
europepmc   +2 more sources

Benchmark dataset for the convex hull of 2D disks. [PDF]

Data Brief, 2019
In this paper, we present a benchmark dataset which can be used to evaluate the algorithms to construct the convex hull of 2D disks. The dataset contains disk arrangements including general and extremely biased cases, which are generated by a C++ program.
Song C, Ryu J, Kim DS.
europepmc   +2 more sources

Optimal base point selection method based on convex hull construction technology [PDF]

E3S Web of Conferences, 2021
The primary purpose of maritime delimitation is to ensure the maximum internal waters area obtained. In order to grantee the maximum internal waters area obtained with the selected base point, the idea and method of optimal selection of the territorial ...
Dong Jian, Zhang Zhiqiang, Tang Lulu, Peng Rencan, Ji Hongchao   +4 more
doaj   +1 more source

An efficient planar incremental convex hull algorithm to find the edges of the boundary polygon of the convex hull of a set of points

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, Xuejian Li, Bo Zhang, Jie Xuan, Yulin Gong, Cheng Tan, Huaguo Huang, Huaqiang Du   +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

EDEM Investigation and Experimental Evaluation of Abrasive Wear Resistance Performance of Bionic Micro-Thorn and Convex Hull Geometrically Coupled Structured Surface

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, Guobiao Zuo, Qinghui Lai, Jin Tong, Zhihong Zhang   +4 more
doaj   +1 more source

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, G.K. GANDHIADI, NI KETUT TARI TASTRAWATI, I PUTU EKA NILA KENCANA   +3 more
doaj   +1 more source