Showing 1 - 20 results of 313 for search '"Convex hull algorithms', 查询时间: 0.40s Refine Results
  1. 1
  2. 2

    Study on the performance characteristics of convex hull algorithms Khin Maung Aye.

    出版 2008
    “...Many convex hull algorithms exist in the computational geometry field. ...”
    获取全文
    Thesis
  3. 3

    An efficient planar incremental convex hull algorithm to find the edges of the boundary polygon of the convex hull of a set of points K. R. Wijeweera, S. R. Kodituwakku

    出版 2021-09-01
    主题: “...convex hull, algorithms, computational geometry, data structures, computational complexity...”
    获取全文
    文件
  4. 4

    AN EFFICIENT ALGORITHM FOR THE CONVEX HULL OF PLANAR SCATTERED POINT SET Z. Fu, Y. Lu

    出版 2012-07-01
    “...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. ...”
    获取全文
    文件
  5. 5
  6. 6
  7. 7

    A Convex Hull-Based Machine Learning Algorithm for Multipartite Entanglement Classification Pingxun Wang

    出版 2022-12-01
    “...In this paper, based on the fact that the set of all W states is convex, we approximate the convex hull by some critical points from the inside and propose a method of classification via the tangent hyperplane. ...”
    获取全文
    文件
  8. 8
  9. 9

    Random convex hulls and kernel quadrature Hayakawa, S

    出版 2023
    “...<p>Discretization of probability measures is ubiquitous in the field of applied mathematics, from classical numerical integration to data compression and algorithmic acceleration in machine learning. In this thesis, starting from generalized Tchakaloff-type cubature, we investigate random convex hulls and kernel quadrature....”
    Thesis
  10. 10
  11. 11
  12. 12
  13. 13

    Convex Hull Monte-Carlo tree search Painter, M, Lacerda, B, Hawes, N

    出版 2020
    “...This work investigates Monte-Carlo planning for agents in stochastic environments, with multiple objectives. We propose the Convex Hull Monte-Carlo Tree-Search (CHMCTS) framework, which builds upon Trial Based Heuristic Tree Search and Convex Hull Value Iteration (CHVI), as a solution to multi-objective planning in large environments. ...”
    Conference item
  14. 14

    Fast, Nondestructive and Precise Biomass Measurements Are Possible Using Lidar-Based Convex Hull and Voxelization Algorithms Matthew H. Siebers, Peng Fu, Bethany J. Blakely, Stephen P. Long, Carl J. Bernacchi, Justin M. McGrath

    出版 2024-06-01
    “...Light detection and ranging (lidar) scanning tools are available that can make rapid digital estimations of biomass. Voxelization and convex hull are two algorithms used to calculate the volume of the scanned plant canopy, which is correlated with biomass, often the primary trait of interest. ...”
    获取全文
    文件
  15. 15
  16. 16

    New Serial and Parallel Algorithms for Finding Convex Hull Based on Clusters, Domains and Directions from Single to Multitude Zhou Qihai

    出版 2009-06-01
    “...An Isomorphic Fundamental Theorem of the Convex Hull Construction is given and proved. A representative serial algorithm convex hull with half-dividing and recurrence is commented as compared example. ...”
    获取全文
    文件
  17. 17

    A priori filtration of points for finding convex hull Laura Vyšniauskaitė, Vydūnas Šaltenis

    出版 2006-12-01
    “...By now there are quite many convex hull algorithms (Graham Scan, Jarvis March, QuickHull, Incremental, Divide‐and‐Conquer, Marriage‐before‐Conquest, Monotone Chain, Brute Force). ...”
    获取全文
    文件
  18. 18

    Fuzzy Clustering Using the Convex Hull as Geometrical Model Luca Liparulo, Andrea Proietti, Massimo Panella

    出版 2015-01-01
    “...It aims to relax some constraints imposed by known algorithms using a generalized geometrical model for clusters that is based on the convex hull computation. ...”
    获取全文
    文件
  19. 19

    Convex Polygonal Hull for a Pair of Irregular Objects V.M. Dubynskyi, O.V. Pankratov, T.E. Romanova, B.S. Lysenko, R.V. Kayafyuk, O.O. Zhmud

    出版 2021-06-01
    “...The problem of placing two irregular two-dimensional objects in a convex polygonal region of the minimum size, which is a convex polygonal hull of the minimum area or perimeter, is considered. ...”
    获取全文
    文件
  20. 20

    CudaPre3D: An Alternative Preprocessing Algorithm for Accelerating 3D Convex Hull Computation on the GPU MEI, G., XU, N.

    出版 2015-05-01
    “...We previously proposed a quite straightforward preprocessing approach for accelerating 2D convex hull computation on the GPU. In this paper, we extend that algorithm to being used in 3D cases. ...”
    获取全文
    文件