Results 31 to 40 of about 6,990,145 (303)
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
NP-completeness of weakly convex and convex dominating set decision problems [PDF]
Opuscula Mathematica, 2004 The convex domination number and the weakly convex domination number are new domination parameters. In this paper we show that the decision problems of convex and weakly convex dominating sets are \(NP\)-complete for bipartite and split graphs.
Joanna Raczek
doaj
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
Strongly convex set-valued maps
Journal of Global Optimization, 2013 We introduce the notion of strongly $$t$$-convex set-valued maps and present some properties of it. In particular, a Bernstein–Doetsch and Sierpiński-type theorems for strongly midconvex set-valued maps, as well as a Kuhn-type result are obtained.
H. Leiva +3 more
semanticscholar +1 more source
On Bishop–Phelps and Krein–Milman Properties
Mathematics, 2023 A real topological vector space is said to have the Krein–Milman property if every bounded, closed, convex subset has an extreme point. In the case of every bounded, closed, convex subset is the closed convex hull of its extreme points, then we say that ...
Francisco Javier García-Pacheco
doaj +1 more source
About Directed d-Convex Simple Graphs [PDF]
Computer Science Journal of Moldova, 2008 In this article we introduce a pseudo-metric on directed graphs, which forms there a family of convex sets. The graphs without d-convex sets, except empty set, sets of one vertex and set of all vertexes, are called d-convex simple.
Nadejda Sur, Sergiu Cataranciuc
doaj
Dynamic Locomotion in the MIT Cheetah 3 Through Convex Model-Predictive Control
IEEE/RJS International Conference on Intelligent RObots and Systems, 2018 This paper presents an implementation of model predictive control (MPC) to determine ground reaction forces for a torque-controlled quadruped robot. The robot dynamics are simplified to formulate the problem as convex optimization while still capturing ...
J. Carlo +4 more
semanticscholar +1 more source
Central limit theorems for random polygons in an arbitrary convex set [PDF]
, 2010 We study the probability distribution of the area and the number of vertices of random polygons in a convex set $K\subset\mathbb{R}^2$. The novel aspect of our approach is that it yields uniform estimates for all convex sets $K\subset\mathbb{R}^2 ...
J. Pardon
semanticscholar +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