Results 11 to 20 of about 542,162 (354)
The convex hull of a sample [PDF]
Bulletin of the American Mathematical Society, 1966 Lloyd D. Fisher
openalex +4 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
Semidefinite descriptions of the convex hull of rotation matrices [PDF]
SIAM Journal on Optimization, 2014 We study the convex hull of $SO(n)$, thought of as the set of $n\times n$ orthogonal matrices with unit determinant, from the point of view of semidefinite programming. We show that the convex hull of $SO(n)$ is doubly spectrahedral, i.e. both it and its
Parrilo, Pablo A. +2 more
core +3 more sources
Generalizing the Convex Hull of a Sample: The R Package alphahull [PDF]
Journal of Statistical Software, 2010 This paper presents the R package alphahull which implements the α-convex hull and the α-shape of a finite set of points in the plane. These geometric structures provide an informative overview of the shape and properties of the point set.
Beatriz Pateiro-López +1 more
doaj +1 more source
Scaling of convex hull volume to body mass in modern primates, non-primate mammals and birds. [PDF]
PLoS One, 2014 The volumetric method of ‘convex hulling’ has recently been put forward as a mass prediction technique for fossil vertebrates. Convex hulling involves the calculation of minimum convex hull volumes (vol CH) from the complete mounted skeletons of modern ...
Brassey CA, Sellers WI.
europepmc +2 more sources
Convex hulls, oracles, and homology
Journal of Symbolic Computation, 2004 This paper presents a new algorithm for the convex hull problem, which is based on a reduction to a combinatorial decision problem POLYTOPE-COMPLETENESS-COMBINATORIAL, which in turn can be solved by a simplicial homology computation. Like other convex hull algorithms, our algorithm is polynomial (in the size of input plus output) for simplicial or ...
Michael Joswig, Günter M. Ziegler
openalex +4 more sources
On the convex hull of convex quadratic optimization problems with indicators [PDF]
Mathematical programming, 2022 We consider the convex quadratic optimization problem in $$\mathbb {R}^{n}$$ R n with indicator variables and arbitrary constraints on the indicators.
Linchuan Wei +3 more
semanticscholar +1 more source
PRIMA: general and precise neural network certification via scalable convex hull approximations [PDF]
Proc. ACM Program. Lang., 2021 Formal verification of neural networks is critical for their safe adoption in real-world applications. However, designing a precise and scalable verifier which can handle different activation functions, realistic network architectures and relevant ...
Mark Niklas Müller +2 more
semanticscholar +1 more source
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