Results 11 to 20 of about 92,928 (266)
AN EFFICIENT ALGORITHM FOR THE CONVEX HULL OF PLANAR SCATTERED POINT SET [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2012 Computing the convex hull of a point set is requirement in the GIS applications. This paper studies on the problem of minimum convex hull and presents an improved algorithm for the minimum convex hull of planar scattered point set.
Z. Fu, Y. Lu
doaj +1 more source
Discrete convex analysis [PDF]
Mathematical Programming, 1998 A theory of "discrete convex analysis" is developed for integer-valued functions defined on integer lattice points. The theory parallels the ordinary convex analysis, covering discrete analogues of the fundamental concepts such as conjugacy, subgradients, the Fenchel min-max duality, separation theorems and the Lagrange duality framework for convex ...
openaire +2 more sources
Variational methods in the presence of symmetry
Advances in Nonlinear Analysis, 2013 The purpose of this paper is to survey and to provide a unified framework to connect a diverse group of results, currently scattered in the literature, that can be usefully viewed as consequences of applying variational methods to problems involving ...
Borwein Jonathan M., Zhu Qiji J.
doaj +1 more source
On the enumeration of column-convex permutominoes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We study the enumeration of \emphcolumn-convex permutominoes, i.e. column-convex polyominoes defined by a pair of permutations. We provide a direct recursive construction for the column-convex permutominoes of a given size, based on the application of ...
Nicholas R. Beaton +3 more
doaj +1 more source
A novel and efficient approach for line segment clipping against a convex polygon
Ruhuna Journal of Science, 2019 This paper proposes a new line clipping algorithm against a convex polygon with š(š) time complexity. The line segment is pruned against each extended edge of the polygon as the first step of the proposed algorithm.
K. R. Wijeweera +2 more
doaj +1 more source
Nonlinear analysis in p-vector spaces for single-valued 1-set contractive mappings
Fixed Point Theory and Algorithms for Sciences and Engineering, 2022 The goal of this paper is to develop some fundamental and important nonlinear analysis for single-valued mappings under the framework of p-vector spaces, in particular, for locally p-convex spaces for 0 < p ā¤ 1 $0 < p \leq 1$ .
George Xianzhi Yuan
doaj +1 more source
An introduction to non-smooth convex analysis via multiplicative derivative
Journal of Taibah University for Science, 2019 In this study, *-directional derivative and *-subgradient are defined using the multiplicative derivative, making a new contribution to non-Newtonian calculus for use in non-smooth analysis.
Ali Hakan Tor
doaj +1 more source
Journal of Mathematics, 2022 In this paper, a new class of functions, namely, exponentially Ī±,hāmāp-convex functions is introduced to unify various classes of functions already defined in the subject of convex analysis.
Kamsing Nonlaopon +4 more
doaj +1 more source
Mathematics, 2023 Many researchers have been attracted to the study of convex analysis theory due to both facts, theoretical significance, and the applications in optimization, economics, and other fields, which has led to numerous improvements and extensions of the ...
Asfand Fahad +3 more
doaj +1 more source
A class of degenerate elliptic eigenvalue problems
Advances in Nonlinear Analysis, 2013 We consider a general class of eigenvalue problems where the leading elliptic term corresponds to a convex homogeneous energy function that is not necessarily differentiable.
Lucia Marcello, Schuricht Friedemann
doaj +1 more source