Results 51 to 60 of about 542,162 (354)
The monotonicity of f-vectors of random polytopes [PDF]
Let K be a compact convex body in Rd, let Kn be the convex hull of n points chosen uniformly and independently in K, and let fi(Kn) denote the number of i-dimensional faces of Kn. We show that for planar convex sets, E(f0(Kn)) is increasing in n.
Devillers, Olivier+4 more
core +6 more sources
Convex Hulls under Uncertainty [PDF]
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 ...
Wuzhou Zhang+4 more
openaire +4 more sources
Parameter Identification of Bivariate Fractal Interpolation Surfaces by Using Convex Hulls
The scope of this article is to identify the parameters of bivariate fractal interpolation surfaces by using convex hulls as bounding volumes of appropriately chosen data points so that the resulting fractal (graph of) function provides a closer fit ...
Vasileios Drakopoulos+3 more
doaj +1 more source
Convex hulls of Lévy processes
Let X(t), t ≥ 0, be a Levy process in Rd starting at the origin. We study the closed convex hull Zs of {X(t) : 0 ≤ t ≤ s}. In particular, we provide conditions for the integrability of the intrinsic volumes of the random set Zs and find explicit expressions for their means in the case of symmetric α-stable Levy processes.
Molchanov, Ilya, Wespi, Florian
openaire +4 more sources
mRMR-Tri-ConcaveHull Detector for Floating Small Targets in Sea Clutter
For the feature-based detector of small targets in sea clutter, on the one hand, the three-dimensional convex hull-based detector deviates from the distribution of sea clutter vectors in the feature space and only combines the information of low ...
Yanling Shi, Yuefeng Hu
doaj +1 more source
Convex hulls in the hyperbolic space [PDF]
We show that there exists a universal constant C>0 such that the convex hull of any N points in the hyperbolic space H^n is of volume smaller than C N, and that for any dimension n there exists a constant C_n > 0 such that for any subset A of H^n, Vol(Conv(A_1)) < C_n Vol(A_1) where A_1 is the set of points of hyperbolic distance to A smaller ...
Ronen Eldan, Itai Benjamini
openaire +4 more sources
Dynamic planar convex hull [PDF]
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).
Riko Jacob, Gerth Stølting Brodal
openaire +3 more sources
An Extended Integral Unit Commitment Formulation and an Iterative Algorithm for Convex Hull Pricing
To increase market transparency, independent system operators (ISOs) have been working on minimizing uplift payments based on convex hull pricing theorems.
Yanan Yu, Yongpei Guan, Yonghong Chen
semanticscholar +1 more source
Error Analysis of the Convex Hull Method for the Solution of the Distribution System Security Region
The convex hull method is a common approach for the solution of the distribution system security region (DSSR). For the first time, this paper identifies that this method is not applicable to solve many DSSRs.
Jun Xiao, Lixing Wang, Yupeng Zhou
doaj +1 more source
Facets of a mixed-integer bilinear covering set with bounds on variables
We derive a closed form description of the convex hull of mixed-integer bilinear covering set with bounds on the integer variables. This convex hull description is determined by considering some orthogonal disjunctive sets defined in a certain way.
Mahajan, Ashutosh, Rahman, Hamidur
core +1 more source