Zobrazeno 1 - 10
of 166
pro vyhledávání: '"Gift wrapping algorithm"'
Publikováno v:
Numerical Algorithms. 85:1499-1518
In this paper, we present an efficient improvement of gift wrapping algorithm for determining the convex hull of a finite set of points in $\mathbb {R}^{n}$ space, applying the best restricted area technique inspired from the Method of Orienting Curv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c97b73b45b44f209832e992cf0e0b6a8
https://doi.org/10.1007/s11075-020-00873-1
https://doi.org/10.1007/s11075-020-00873-1
Publikováno v:
IEEE Transactions on Neural Networks and Learning Systems. 29:792-806
Reducing samples through convex hull vertices selection (CHVS) within each class is an important and effective method for online classification problems, since the classifier can be trained rapidly with the selected samples. However, the process of C
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f739a310f26057523012d6b5bfa6c154
https://doi.org/10.1109/tnnls.2017.2648038
https://doi.org/10.1109/tnnls.2017.2648038
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Theoretical Computer Science. 702:48-59
Bounding hulls such as convex hull, -shape, -hull, concave hull, crust, etc. offer a wide variety of useful applications. In this paper, we explore another bounding hull, namely -concave hull, as a generalization of convex hull. The parameter determi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::afb162904aed41be94e493128c820884
https://doi.org/10.1016/j.tcs.2017.08.014
https://doi.org/10.1016/j.tcs.2017.08.014
Publikováno v:
SIAM Review. 59:346-365
The convex hull of a set of points, $C$, serves to expose extremal properties of $C$ and can help identify elements in $C$ of high interest. For many problems, particularly in the presence of noise, the true vertex set (and facets) may be difficult t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a0afa6cddc594234d038f90deaf6fcb3
https://doi.org/10.1137/15m1047921
https://doi.org/10.1137/15m1047921
Autor:
Abel J. P. Gomes
Publikováno v:
Computer-Aided Design. 70:153-160
Computing the convex hull of a set of points is a fundamental operation in many research fields, including geometric computing, computer graphics, computer vision, robotics, and so forth. This problem is particularly challenging when the number of po
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dcb51dc93f8edbecc936d77366a5d7cf
https://doi.org/10.1016/j.cad.2015.07.013
https://doi.org/10.1016/j.cad.2015.07.013
Publikováno v:
Advances in Engineering Software. 91:12-22
Algorithm for computing the convex hull of a set of points in E3 we are proposed.The algorithm is based on spherical space subdivision.The algorithm eliminates as many input points as possible before the convex hull calculation.Experimental results s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::23ac5e627d762bb0b8b3604d6ed7dd2d
https://doi.org/10.1016/j.advengsoft.2015.09.002
https://doi.org/10.1016/j.advengsoft.2015.09.002
Publikováno v:
Chinese Journal of Electronics. 24:317-320
A quick convex hull building algorithm using grid and binary tree is proposed for the minimum convex buidling of planar point set. Grids are used to assess and eliminate those interior points wihtout any contribution to convex hull building and point
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5e5bc4432a49ae10eba7d93cd6f81e3c
https://doi.org/10.1049/cje.2015.04.015
https://doi.org/10.1049/cje.2015.04.015
Publikováno v:
IEEE Transactions on Knowledge and Data Engineering. 27:852-865
The convex hull of a set of two-dimensional points, $P$ , is the minimal convex polygon that contains all the points in $P$ . Convex hull is important in many applications such as GIS, statistical analysis and data mining. Due to the ubiquity of data
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::630039555cb0bd496739411623a199b8
https://doi.org/10.1109/tkde.2014.2340408
https://doi.org/10.1109/tkde.2014.2340408
Autor:
Le Dung Muu, Nguyen Kieu Linh
Publikováno v:
RAIRO - Operations Research. 49:589-600
An important problem in distance geometry is of determining the position of an unknown point in a given convex set such that its longest distance to a set of finite number of points is shortest. In this paper we present an algorithm based on subgradi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02ceb6857d6d47d51b7f219c4e409ff2
https://doi.org/10.1051/ro/2014058
https://doi.org/10.1051/ro/2014058