Results 41 to 50 of about 542,162 (354)
Formalizing Convex Hull Algorithms [PDF]
, 2001 We study the development of formally proved algorithms for computational geometry. The result of this work is a formal description of the basic principles that make convex hull algorithms work and two programs that implement convex hull computation and have been automatically obtained from formally verified mathematical proofs.
Pichardie, David, Bertot, Yves
openaire +4 more sources
Computing convex hulls of trajectories [PDF]
Revista de la Unión Matemática Argentina, 2019 26 pages, 10 ...
Andreas Löhne +3 more
openaire +3 more sources
IEEE Access, 2019 For the feature tensor of multi-sensor signals classification problem in gear intelligent fault diagnosis, a new tensor classifier named nearest neighbor convex hull tensor classification (NNCHTC) is proposed in this paper.
Zhengyang Cheng, Rongji Wang
doaj +1 more source
Random sets and Choquet-type representations [PDF]
arXiv, 2022 As appropriate generalizations of convex combinations with uncountably many terms, we introduce the so-called Choquet combinations, Choquet decompositions and Choquet convex decompositions, as well as their corresponding hull operators acting on the power sets of Lebesgue-Bochner spaces.
arxiv
The limit shape of convex hull peeling [PDF]
Duke mathematical journal, 2018 We prove that the convex peeling of a random point set in dimension d approximates motion by the 1/(d + 1) power of Gaussian curvature. We use viscosity solution theory to interpret the limiting partial differential equation. We use the Martingale method
J. Calder, Charles K. Smart
semanticscholar +1 more source
Hildebrandt's theorem for the essential spectrum [PDF]
Opuscula Mathematica, 2015 We prove a variant of Hildebrandt's theorem which asserts that the convex hull of the essential spectrum of an operator \(A\) on a complex Hilbert space is equal to the intersection of the essential numerical ranges of operators which are similar to \(A\
Janko Bračič, Cristina Diogo
doaj +1 more source
Convex hulls of face-vertex incident vectors of 3-colorable polytopes [PDF]
arXiv, 2021 The convex hulls of face-vertex incident vectors of 3-face-colorable convex polytopes are computed. It is found that every such convex hull is a $d$-polytope with $d+2$ or $d+3$ vertices. Utilizing Gale transform and Gale diagram, we calculate its combinatorial structure.
arxiv
The convex hull of a planar random walk : perimeter, diameter, and shape. [PDF]
, 2018 We study the convex hull of the first n steps of a planar random walk, and present large-n asymptotic results on its perimeter length Ln, diameter Dn, and shape. In the case where the walk has a non-zero mean drift, we show that Ln=Dn !
James McRedmond, A. Wade
semanticscholar +1 more source
Convex Hull of the Quadratic Branch AC Power Flow Equations and Its Application in Radial Distribution Networks [PDF]
IEEE Transactions on Power Systems, 2017 A branch flow model (BFM) is used to formulate the AC power flow in general networks. For each branch/line, the BFM contains a nonconvex quadratic equality.
Qifeng Li, V. Vittal
semanticscholar +1 more source
Convex Hulls of Dragon Curves [PDF]
arXiv, 2022 Dragon curves, are a family of self-similar sets in the plane. We prove that every dragon curve has a polygonal convex hull. Moreover, the vertices of the convex hull of the Dragon curves are given in some case.
arxiv