Results 31 to 40 of about 545,686 (65)
Computation of the Hausdorff Distance between Two Compact Convex Sets
Algorithms, 2023 The Hausdorff distance between two closed sets has important theoretical and practical applications. Yet apart from finite point clouds, there appear to be no generic algorithms for computing this quantity.
Kenneth Lange
doaj +1 more source
Ball and Spindle Convexity with respect to a Convex Body [PDF]
, 2012 Let $C\subset {\mathbb R}^n$ be a convex body. We introduce two notions of convexity associated to C. A set $K$ is $C$-ball convex if it is the intersection of translates of $C$, or it is either $\emptyset$, or ${\mathbb R}^n$.
Lángi, Zsolt +2 more
core +2 more sources
Number of Spinal-Convex Polyominoes
Journal of Kufa for Mathematics and Computer, 2020 In his paper we describe a restricted class of polyominoes called spinal-convex polyominoes. Spinal-convex polyominoes created by two columns such that column 1 (respectively, column2) with at most two set columns sequence of adjacent ominoes and column ...
Mustafa A. Sabri, Eman F. Mohomme
doaj +1 more source
On Infinitesimal Approximation of a Continuous Function [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2010 If and are convex subsets in , and in for all . If the approximation family is the set An Infinitesimal approximation of an element in established in [4],[5].
Tahir Ismail
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
Convex Independence in Permutation Graphs
, 2016 A set C of vertices of a graph is P_3-convex if every vertex outside C has at most one neighbor in C. The convex hull \sigma(A) of a set A is the smallest P_3-convex set that contains A.
B Courcelle +11 more
core +1 more source
Covariance Estimation in Elliptical Models with Convex Structure
, 2013 We address structured covariance estimation in Elliptical distribution. We assume it is a priori known that the covariance belongs to a given convex set, e.g., the set of Toeplitz or banded matrices.
Soloveychik, Ilya, Wiesel, Ami
core +1 more source
The Hermite-Hadamard inequality for s-Convex functions in the third sense
AIMS Mathematics, 2021 In this paper, the Hermite-Hadamard inequality for s-convex functions in the third sense is provided. In addition, some integral inequalities for them are presented.
Sevda Sezer
doaj +1 more source
, 2014 We address the problem of one dimensional segment detection and estimation, in a regression setup. At each point of a fixed or random design, one observes whether that point belongs to the unknown segment or not, up to some additional noise.
Brunel, Victor-Emmanuel
core +1 more source
Triangulation Algorithm Based on Empty Convex Set Condition
Vestnik Volgogradskogo Gosudarstvennogo Universiteta. Serija 1. Mathematica. Physica, 2015 The article is devoted to generalization of Delaunay triangulation. We suggest to consider empty condition for special convex sets. For given finite set P ⊂ Rn we shall say that empty condition for convex set B ⊂ Rn is fullfiled if P ∩ B = P ∩ ∂B. Let Φ =
Klyachin Vladimir Aleksandrovich
doaj +1 more source