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
Convex regions in the plane and their domes [PDF]
, 2006 We make a detailed study of the relation of a euclidean convex region $\Omega \subset \mathbb C$ to $\mathrm{Dome} (\Omega)$. The dome is the relative boundary, in the upper halfspace model of hyperbolic space, of the hyperbolic convex hull of the ...
Markovic, V. +3 more
core +1 more source
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes [PDF]
Proceedings of the twenty-seventh annual symposium on Computational geometry, 2011 Given a set $Σ$ of spheres in $\mathbb{E}^d$, with $d\ge{}3$ and $d$ odd, having a fixed number of $m$ distinct radii $ρ_1,ρ_2,...,ρ_m$, we show that the worst-case combinatorial complexity of the convex hull $CH_d(Σ)$ of $Σ$ is $Θ(\sum_{1\le{}i\ne{}j\le{}m}n_in_j^{\lfloor\frac{d}{2}\rfloor})$, where $n_i$ is the number of spheres in $Σ$ with radius ...
Menelaos I. Karavelas, Eleni Tzanaki
openaire +2 more sources
Largest convex hulls for convex-hull disjoint clusters with bounded size
Theoretical Computer Science, 2023 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xuehou Tan, Rong Chen
openaire +1 more source
Rapid preconditioning of data for accelerating convex hull algorithms [PDF]
, 2014 Given a dataset of two-dimensional points in the plane with integer coordinates, the method proposed reduces a set of n points down to a set of s points s ≤ n, such that the convex hull on the set of s points is the same as the convex hull of the ...
Medina, Jose Cadenas +6 more
core +1 more source
PENGKLASIFIKASIAN DEBITUR DENGAN MENGGUNAKAN ALGORITMA GRAHAM SCAN DALAM PENGAPLIKASIAN CONVEX HULL
E-Jurnal Matematika, 2013 Computational geometry is the mathematical science of computation by using the algorithm analysis to solve the problems of geometry. The problems of computational include polygon triangulations, convex hulls, Voronoi diagrams, and motion planning. Convex
AGUS EKA ARIESTA +3 more
doaj +1 more source
A comparison of heuristic and human performance on open versions of the traveling salesperson problem. [PDF]
, 2006 We compared the performance of three heuristics with that of subjects on variants of a well-known combinatorial optimization task, the Traveling Salesperson Problem (TSP). The present task consisted of finding the shortest path through an array of points
MacGregor, James N. +6 more
core +1 more source
Dynamic planar convex hull [PDF]
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 2003 In this article, we determine the amortized computational complexity of the planar dynamic convex hull problem by querying. We present a data structure that maintains a set of n points in the plane under the insertion and deletion of points in amortized O(log n) time per operation. The space usage of the data structure is O(n).
Jacob, Riko, Brodal, Gerth
openaire +2 more sources
Recognition and localization method of occluded apples based on K-means clustering segmentation algorithm and convex hull theory [PDF]
智慧农业, 2019 Accurate segmentation and localization of apple objects in natural scenes is an important part of wisdom agriculture research for information perception and acquisition.
Jiang Mei, Sun Sashuang, He Dongjian, Song Huaibo
doaj +1 more source
Local hull-based surface construction of volumetric data from silhouettes [PDF]
, 2008 The marching cubes (MC) is a general method which can construct a surface of an object from its volumetric data generated using a shape from silhouette method. Although MC is efficient and straightforward to implement, a MC surface may have discontinuity
Tjahjadi, Tardi, Shin, Dongjoe
core +1 more source