Results 21 to 30 of about 99,998 (314)
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
On Some Corollaries of a Transversal Theorem
Моделирование и анализ информационных систем, 2015 In this paper we consider theorems which are generalizations of the well-known corollaries of the Helly ...
V. L. Dolnikov
doaj +1 more source
On the convex layers of a planer dynamic set of points
Ceylon Journal of Science, 2018 The convex hull of a planer set of points can be defined as the set of vertices of the smallest convex polygon containing all the points. If S is a planer set of points then convex layers of S can be derived by iteratively computing the convex hull of S ...
K. R. Wijeweera, S. R. Kodituwakku
doaj +1 more source
Set-Theoretic Inequalities Based on Convex Multi-Argument Approximate Functions via Set Inclusion
Journal of Function Spaces, 2022 Hypersoft set is a novel area of study which is established as an extension of soft set to handle its limitations. It employs a new approximate mapping called multi-argument approximate function which considers the Cartesian product of attribute-valued ...
Atiqe Ur Rahman +3 more
doaj +1 more source
Convex Hull for Planar H-Polyhedra [PDF]
, 2003 Suppose $\langle A_i, \vec{c}_i \rangle$ are planar (convex) H-polyhedra, that is, (unknown variable A_i) \in \mathbb{R}^{n_i \times 2}$ and $\vec{c}_i \in \mathbb{R}^{n_i}$.
Andy King +3 more
core +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
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
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
Intersecting convex sets by rays [PDF]
Proceedings of the twenty-fourth annual symposium on Computational geometry, 2008 What is the smallest number \(\tau=\tau(n)\) such that for any collection of \(n\) pairwise disjoint convex sets in \(d\)-dimensional Euclidean space there is a point such that any ray emanating from it meets at most \(\tau\) sets of the collection? The authors prove estimates for \(\tau\). For instance it is demonstrated that \(\tau\leq (dn+1)/(d+1)\).
Radoslav Fulek +2 more
openaire +2 more sources
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