• Journal of the Korean Mathematical Society
• /
• v.37 no.6
• /
• pp.885-899
• /
• 2000

We obtain generalized versions of the Fan-Browder fixed point theorem for G-convex spaces. We define the class B of better admissible multimaps on G-convex spaces and show that any closed compact map in b fro ma locally G-convex uniform space into itself has a fixed point.

• Journal of Electrical Engineering and information Science
• /
• v.3 no.3
• /
• pp.281-285
• /
• 1998

Consider the two-dimensional sorted-set convex hull problem: Given N points in a plane sorted by the x coordinates, compute the convex hull of the points. We propose an O(logNlog logN)-time algorithm that solves the sorted-set convex hull problem on an N\ulcorner\ulcorner${\times}$N\ulcorner\ulcorner reconfigurable mesh. The best known algorithm for the problem on an N\ulcorner\ulcorner${\times}$N\ulcorner\ulcorner reconfigurable mesh takes O(log\ulcornerN) time. Although there is a constant-time algorithm on an N${\times}$N reconfigurable mesh for general two-dimensional convex hull problem, the general convex hull problem requires Θ(N\ulcorner\ulcorner) time on an N\ulcorner\ulcorner${\times}$N\ulcorner\ulcorner reconfigurable mesh due to bandwidth constraints.

• Journal of IKEEE
• /
• v.17 no.1
• /
• pp.29-35
• /
• 2013

In this paper, we suggest an improved Convex Hull algorithm considering sort in plane point set. This algorithm has low computational complexity since processing data are reduced by characteristic of extreme points. Also it obtains a complete convex set with just one processing using an convex vertex discrimination criterion. Initially it requires sorting of point set. However we can't quickly sort because of its heavy operations. This problem was solved by replacing value and index. We measure the execution time of algorithms by generating a random set of points. The results of the experiment show that it is about 2 times faster than the existing algorithm.

• Journal of the Korean Mathematical Society
• /
• v.35 no.2
• /
• pp.491-502
• /
• 1998

We obtain new fixed point theorems on maps defined on "locally G-convex" subsets of a generalized convex spaces. Our first theorem is a Schauder-Tychonoff type generalization of the Brouwer fixed point theorem for a G-convex space, and the second main result is a fixed point theorem for the Kakutani maps. Our results extend many known generalizations of the Brouwer theorem, and are based on the Knaster-Kuratowski-Mazurkiewicz theorem. From these results, we deduce new results on collectively fixed points, intersection theorems for sets with convex sections and quasi-equilibrium theorems.

• Journal of the Chungcheong Mathematical Society
• /
• v.36 no.4
• /
• pp.279-288
• /
• 2023

We obtain a Chandrabhan type fixed point theorem for a multimap having a non-compact domain and a weakly closed graph, and taking convex values only on a quasi-convex subset of Hausdorff locally convex topological vector space. We introduce the definition of Chandrabhan-set and find a sufficient condition for every countably condensing multimap to have a relatively compact Chandrabhan-set. Finally, we establish a new version of Sadovskii fixed point theorem for multimaps.

• Journal of the Chungcheong Mathematical Society
• /
• v.25 no.4
• /
• pp.617-631
• /
• 2012

In this paper, we will consider some existence theorems of common fixed points for a countable family of non-self multi-valued mappings defined on a closed subset of a complete metrically convex space, and give more generalized common fixed point theorems for a countable family of single-valued mappings. The main results in this paper generalize and improve many common fixed point theorems for single valued or multi-valued mappings with contractive type conditions.

• East Asian mathematical journal
• /
• v.26 no.1
• /
• pp.39-47
• /
• 2010

Existence of common fixed points for generalized S-nonexpansive subcompatible mappings in convex metric spaces have been obtained. Invariant approximation results have also been derived by its application. These results extend and generalize various known results in the literature with the aid of more general class of noncommuting mappings.

• Korean Journal of Mathematics
• /
• v.31 no.2
• /
• pp.123-131
• /
• 2023

In this paper, we prove existence of best proximity points for 2-convex contraction, 2-sided contraction, and M-weakly cyclic 2-convex contraction mappings in the setting of complete strongly regular generalized modular metric spaces that generalize many results in the literature.

• Communications for Statistical Applications and Methods
• /
• v.22 no.1
• /
• pp.69-80
• /
• 2015

In this paper, the probability that a given point is covered by a random convex hull generated by independent and identically-distributed random points in a plane is studied. It is shown that such probability can be expressed in terms of an integral that can be approximated numerically by function-evaluations over the grid-points in a 2-dimensional space. The new integral representation allows such probability be computed efficiently. The computational burdens under the proposed integral representation and those in the existing literature are compared. The proposed method is illustrated through numerical examples where the random points are drawn from (i) uniform distribution over a square and (ii) bivariate normal distribution over the two-dimensional Euclidean space. The applications of the proposed method in statistics are are discussed.

• Honam Mathematical Journal
• /
• v.16 no.1
• /
• pp.41-45
• /
• 1994