A New Convex Hull Algorithm for Planar Sets
From MaRDI portal
Cited in
(43)- Some performance tests of convex hull algorithms
- Another efficient algorithm for convex hulls in two dimensions
- Voronoi diagrams from convex hulls
- On the (n n) lower bound for convex hull and maximal vector determination
- A note on linear expected time algorithms for finding convex hulls
- Further comments on Bykat's convex hull algorithm
- Divide and conquer for linear expected time
- Displaying a clustering with CLUSPLOT.
- An approximate algorithm for computing multidimensional convex hulls
- Robust gift wrapping for the three-dimensional convex hull
- Computing depth contours of bivariate point clouds
- Three-dimensional unstructured mesh generation. I: Fundamental aspects of triangulation and point creation
- \(\alpha\)-concave hull, a generalization of convex hull
- Convex-hull algorithms: implementation, testing, and experimentation
- Considering the attractor structure of chaotic maps for observer-based synchronization problems
- Structural health monitoring of tall buildings with numerical integrator and convex-concave hull classification
- Using tours to visually investigate properties of new projection pursuit indexes with application to problems in physics
- QuickhullDisk: a faster convex hull algorithm for disks
- Validation in principal components analysis applied to EEG data
- Quicker than Quickhull
- Modeling the growth of objects through a stochastic process of random sets
- A fast and efficient algorithm for determining the connected orthogonal convex hulls
- Mixture models with an unknown number of components via a new posterior split-merge MCMC algorithm
- Clustering gene expression data using a posterior split-merge-birth procedure
- Graphical exploration of the weight space in three-objective mixed integer linear programs
- On finding the convex hull of a simple polygon
- Multi-core Implementations of Geometric Algorithms
- Triangulation automatique d’un polyèdre en dimension $N$
- Convex hull of a planar set of straight and circular line segments
- On the coefficient of variation of mixtures of probability distributions
- A new point creation scheme for uniform Delaunay triangulation
- Bivariate Residual Plots With Simulation Polygons
- Partitioning gene expression data by data-driven Markov chain Monte Carlo
- Space-efficient planar convex hull algorithms
- Estimating and enlarging the region of attraction of multi-equilibrium points system by state-dependent edge impulses
- Randomized quickhull
- Inner -approximation of the convex hull of finite sets
- Octagonal and hexadecagonal cut algorithms for finding the convex hull of finite sets with linear time complexity
- A lower bound for the quickhull convex hull algorithm that disproves the quickhull precision conjecture
- Delaunay triangulation and the convex hull of n points in expected linear time
- An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\)
- An efficient and numerically correct algorithm for the 2D convex hull problem
- Random convex hulls and extreme value statistics
This page was built for publication: A New Convex Hull Algorithm for Planar Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4151725)
