Results 1 to 10 of about 542,063 (255)
On the convex hull and homothetic convex hull functions of a convex body [PDF]
Geometriae Dedicata, 2022 AbstractThe aim of this note is to investigate the properties of the convex hull and the homothetic convex hull functions of a convex body K in Euclidean n-space, defined as the volume of the union of K and one of its translates, and the volume of K and a translate of a homothetic copy of K, respectively, as functions of the translation vector.
Ákos G. Horváth, Zsolt Lángi
semanticscholar +5 more sources
Extreme-value statistics from Lagrangian convex hull analysis for homogeneous turbulent Boussinesq convection and MHD convection [PDF]
New Journal of Physics, 2017 We investigate the utility of the convex hull of many Lagrangian tracers to analyze transport properties of turbulent flows with different anisotropy. In direct numerical simulations of statistically homogeneous and stationary Navier–Stokes turbulence ...
J Pratt +4 more
doaj +6 more sources
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
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes [PDF]
Proceedings of the twenty-seventh annual symposium on Computational geometry, 2011 Given a set $\Sigma$ of spheres in $\mathbb{E}^d$, with $d\ge{}3$ and $d$ odd, having a fixed number of $m$ distinct radii $\rho_1,\rho_2,...,\rho_m$, we show that the worst-case combinatorial complexity of the convex hull $CH_d(\Sigma)$ of $\Sigma$ is $\
Karavelas, Menelaos I., Tzanaki, Eleni
core +3 more sources
Relative Convex Hull Determination from Convex Hulls in the Plane [PDF]
, 2016 A new algorithm for the determination of the relative convex hull in the plane of a simple polygon A with respect to another simple polygon B which contains A, is proposed.
A Biswas +21 more
core +4 more sources
Congruency effects in dot comparison tasks: convex hull is more important than dot area. [PDF]
J Cogn Psychol (Hove), 2016 The dot comparison task, in which participants select the more numerous of two dot arrays, has become the predominant method of assessing Approximate Number System (ANS) acuity.
Gilmore C, Cragg L, Hogan G, Inglis M.
europepmc +2 more sources
Relative interiors of convex hulls [PDF]
Proceedings of the American Mathematical Society, 1969 Generalizations of this theorem have either tried to characterize when an upper bound of 2n, 2n -1, etc. for card B is necessarily assumed (see [4], [5]), have added further conditions on the set A in order to obtain better bounds on card B (see [1][4]), or have asked for the bounds on card B if we demand only wEintd conv B where O?d ?n.
William E. Bonnice, John R. Reay
openalex +3 more sources
Computational Geometry, 2001 AbstractIn this paper we address the problem of computing a minimal representation of the convex hull of the union of k H-polytopes in Rd. Our method applies the reverse search algorithm to a shelling ordering of the facets of the convex hull. Efficient wrapping is done by projecting the polytopes onto the two-dimensional space and solving a linear ...
Komei Fukuda +2 more
openalex +3 more sources
Approximate Convex Hulls: sketching the convex hull using curvature [PDF]
arXiv, 2017 Convex hulls are fundamental objects in computational geometry. In moderate dimensions or for large numbers of vertices, computing the convex hull can be impractical due to the computational complexity of convex hull algorithms. In this article we approximate the convex hull in using a scalable algorithm which finds high curvature vertices with high ...
Graham, Robert, Oberman, Adam M.
arxiv +3 more sources