Results 1 to 10 of about 11,209 (254)
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.
Oswaldo Cadenas, Graham M Megson
doaj +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.
José Oswaldo Cadenas +2 more
doaj +2 more sources
Benchmark dataset for the convex hull of 2D disks [PDF]
Data in 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.
Chanyoung Song +2 more
doaj +2 more sources
From automatic integration to selective control: time-resolved effects of sensory cues on numerical comparison [PDF]
Frontiers in NeuroscienceIntroductionApproximate numerical comparison is often influenced by various non-numerical sensory cues, yet whether they act via uniform inhibition (inhibitory control theory) or cue-weighted integration (sensory integration theory) remains debated ...
Xiao Liang +3 more
doaj +2 more sources
Characterizing the spatial structures of competing football teams [PDF]
Scientific ReportsProgress in football analytics is hampered by two main reasons: the unavailability of detailed datasets; and a dearth of meaningful metrics that would aid in gaining insight into the collective action of teams.
Guy Amichay +3 more
doaj +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 +4 more
doaj +1 more source
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
Convex Hulls under Uncertainty [PDF]
Algorithmica, 2014 We study the convex-hull problem in a probabilistic setting, motivated by the need to handle data uncertainty inherent in many applications, including sensor databases, location-based services and computer vision. In our framework, the uncertainty of each input site is described by a probability distribution over a finite number of possible locations ...
Agarwal, Pankaj K. +4 more
openaire +2 more sources