A New Convex Hull Algorithm for Planar Sets

From MaRDI portal
Publication:4151725

DOI10.1145/355759.355766zbMath0374.68036OpenAlexW1968634208MaRDI QIDQ4151725

William F. Eddy

Publication date: 1977

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/355759.355766




Related Items

Mixture models with an unknown number of components via a new posterior split-merge MCMC algorithmAn efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\)Robust gift wrapping for the three-dimensional convex hullA new point creation scheme for uniform Delaunay triangulationComputing depth contours of bivariate point cloudsGraphical exploration of the weight space in three-objective mixed integer linear programsClustering Gene Expression Data using a Posterior Split-Merge-Birth ProcedureBivariate Residual Plots With Simulation PolygonsThree-dimensional unstructured mesh generation. I: Fundamental aspects of triangulation and point creationSpace-efficient planar convex hull algorithms\(\alpha\)-concave hull, a generalization of convex hullA fast and efficient algorithm for determining the connected orthogonal convex hullsAnother efficient algorithm for convex hulls in two dimensionsVoronoi diagrams from convex hullsOn the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determinationA note on linear expected time algorithms for finding convex hullsFurther comments on Bykat's convex hull algorithmEstimating and enlarging the region of attraction of multi-equilibrium points system by state-dependent edge impulsesUsing tours to visually investigate properties of new projection pursuit indexes with application to problems in physicsStructural health monitoring of tall buildings with numerical integrator and convex-concave hull classificationConvex-hull algorithms: implementation, testing, and experimentationAn efficient and numerically correct algorithm for the 2D convex hull problemPartitioning gene expression data by data-driven Markov chain Monte CarloModeling the growth of objects through a stochastic process of random setsRandomized quickhullRandom convex hulls and extreme value statisticsOn finding the convex hull of a simple polygonConsidering the attractor structure of chaotic maps for observer-based synchronization problemsQuickhullDisk: a faster convex hull algorithm for disksDivide and conquer for linear expected timeMulti-core Implementations of Geometric AlgorithmsDisplaying a clustering with CLUSPLOT.Convex hull of a planar set of straight and circular line segmentsAn approximate algorithm for computing multidimensional convex hullsValidation in principal components analysis applied to EEG dataOn the coefficient of variation of mixtures of probability distributionsDelaunay triangulation and the convex hull of n points in expected linear timeTriangulation automatique d’un polyèdre en dimension $N$Some performance tests of convex hull algorithmsQuicker than Quickhull