The quickhull algorithm for convex hulls
From MaRDI portal
Publication:4371114
DOI10.1145/235815.235821zbMath0884.65145OpenAlexW2153504150WikidataQ29014474 ScholiaQ29014474MaRDI QIDQ4371114
Hannu Huhdanpaa, David P. Dobkin, C. Bradford Barber
Publication date: 7 January 1998
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1996-22/
algorithmconvex hullVoronoi diagramcomputational geometryDelaunay triangulationquickhull algorithmbeneath-beyond algorithm
Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (only showing first 100 items - show all)
Transient landing dynamics analysis for a lunar lander with random and interval fields ⋮ Robust vertex enumeration for convex hulls in high dimensions ⋮ Runtime monitors for Markov decision processes ⋮ Multi-periodic neural coding for adaptive information transfer ⋮ Gift-wrapping based preimage computation algorithm ⋮ An interdependency index for the outputs of uncertain systems ⋮ A homothetic reference technology in data envelopment analysis ⋮ Tetrahedral meshing via maximal Poisson-disk sampling ⋮ Local convex hulls for a special class of integer multicommodity flow problems ⋮ Dynamic output feedback robust model predictive control via zonotopic set-membership estimation for constrained quasi-LPV systems ⋮ A cutting plane algorithm for the capacitated facility location problem ⋮ Graphical exploration of the weight space in three-objective mixed integer linear programs ⋮ How good are convex hull algorithms? ⋮ Affine invariant comparison of point-sets using convex hulls and Hausdorff distances ⋮ Confinement-shear lattice CSL model for fracture propagation in concrete ⋮ Linearly interpolated FDH efficiency score for nonconvex frontiers ⋮ Computation of the best Diophantine approximations and of fundamental units of algebraic fields ⋮ Verified convex hull and distance computation for octree-encoded objects ⋮ Post-processing partitions to identify domains of modularity optimization ⋮ Coupling extended magnetohydrodynamic fluid codes with radiofrequency ray tracing codes for fusion modeling ⋮ Stochastic generation of particle structures with controlled degree of heterogeneity ⋮ Single particle fragmentation in ultrasound assisted impact comminution ⋮ Identifying connected components in Gaussian finite mixture models for clustering ⋮ Three-dimensional unstructured mesh generation. I: Fundamental aspects of triangulation and point creation ⋮ Multiscale modeling and characterization of granular matter: from grain kinematics to continuum mechanics ⋮ Extending local mixture models ⋮ Semi-explicit MPC based on subspace clustering ⋮ Post-optimality approach to prevent cycling in linear MPC target calculation ⋮ Numerical algorithm for solving the problem of synthesis of impulse controls under uncertainty ⋮ Analytic approximation of spatial epidemic models of foot and mouth disease ⋮ Computing projection depth and its associated estimators ⋮ Computing convex quadrangulations ⋮ Recursive voids for identifying a nonconvex boundary of a set of points in the plane ⋮ MPC of constrained discrete-time linear periodic systems -- a framework for asynchronous control: strong feasibility, stability and optimality via periodic invariance ⋮ Bivariate nonparametric estimation of the Pickands dependence function using Bernstein copula with kernel regression approach ⋮ An efficient convex hull algorithm using affine transformation in planar point set ⋮ Voronoi-cell finite difference method for accurate electronic structure calculation of polyatomic molecules on unstructured grids ⋮ Likelihood of environmental coalitions and the number of coalition members: evidences from an IAM model ⋮ Representation complexity of adaptive 3D distance fields ⋮ A local search algorithm for ray-convex polyhedron intersection ⋮ Dynamic balance preservation and prevention of sliding for humanoid robots in the presence of multiple spatial contacts ⋮ Computing multiple-output regression quantile regions ⋮ Principal components of sample estimates: an approach through symbolic data analysis ⋮ Statistical measures of two dimensional point set uniformity ⋮ Convex-hull algorithms: implementation, testing, and experimentation ⋮ Analysis of a triangulation based approach for specimen generation for discrete element simulations. ⋮ Efficient mesh optimization schemes based on optimal Delaunay triangulations ⋮ Certifying algorithms ⋮ Knowledge-based computational mutagenesis for predicting the disease potential of human non-synonymous single nucleotide polymorphisms ⋮ Errors bounds for finite approximations of coherent lower previsions on finite probability spaces ⋮ Multivariate spacings based on data depth. I: Construction of nonparametric multivariate tolerance regions ⋮ Application of general semi-infinite programming to lapidary cutting problems ⋮ Methods for estimation of convex sets ⋮ Extended formulations for convex envelopes ⋮ Rock mechanics model capable of representing initial heterogeneities and full set of 3D failure mechanisms ⋮ Visualizing production surfaces in 3D diagrams ⋮ Interactive classification using data envelopment analysis ⋮ X-TMCMC: adaptive kriging for Bayesian inverse modeling ⋮ A general solution for robust linear programs with distortion risk constraints ⋮ The depth-design: an efficient generation of high dimensional computer experiments ⋮ Detecting kinematic boundary surfaces in phase space: particle mass measurements in SUSY-like events ⋮ Fuzzy clustering using the convex hull as geometrical model ⋮ Computing minimal interpolants in \(C^{1,1}(\mathbb{R}^d)\) ⋮ Weighted sum model with partial preference information: application to multi-objective optimization ⋮ A parametric simplex algorithm for linear vector optimization problems ⋮ A simplicial homology algorithm for Lipschitz optimisation ⋮ A linear-time algorithm to compute the triangular hull of a digital object ⋮ PAINT: Pareto front interpolation for nonlinear multiobjective optimization ⋮ Computation for maximum stable grasping in dynamic force distribution ⋮ TRIOPT: A triangulation-based partitioning algorithm for global optimization ⋮ Real-time fuzzy regression analysis: a convex hull approach ⋮ Error control in polytope computations ⋮ Stochastic dynamic programming applied to hydrothermal power systems operation planning based on the convex hull algorithm ⋮ Convex hull properties and algorithms ⋮ Stability analysis of nonlinear quadratic systems via polyhedral Lyapunov functions ⋮ Surface area estimation of digitized 3D objects using quasi-Monte Carlo methods ⋮ Affine tensor product model transformation ⋮ Dynamic output feedback robust MPC with input saturation based on zonotopic set-membership estimation ⋮ Numerical methods for linear impulse feedback problems ⋮ A Matlab-based rapid method for computing lattice-subspaces and vector sublattices of \(\mathbb R^n\): applications in portfolio insurance ⋮ Convergent extension by intercalation without mediolaterally fixed cell motion ⋮ An empirical study of tests for uniformity in multidimensional data ⋮ Dynamic scheduling for switched processing systems with substantial service-mode switching times ⋮ A solution method for linear variational relation problems ⋮ Benson type algorithms for linear vector optimization and applications ⋮ Three-dimensional random Voronoi tessellations: from cubic crystal lattices to Poisson point processes ⋮ A multivariate uniformity test for the case of unknown support ⋮ Improved boundary tracking in meshless simulations of free-surface flows ⋮ A computational basis for higher-dimensional computational geometry and applications ⋮ Generalizations of Schöbi's tetrahedral dissection ⋮ A semi-supervised approach to space carving ⋮ Efficient \(O(N)\) integration for all-electron electronic structure calculation using numeric basis functions ⋮ Relaxation Runge-Kutta methods for Hamiltonian problems ⋮ Simplex based space filling designs ⋮ Carving out OPE space and precise O(2) model critical exponents ⋮ A fuzzy model for linear regression ⋮ Triangulations in CGAL ⋮ Optimal affine leader functions in reverse Stackelberg games. Existence conditions and characterization ⋮ Computing halfspace depth contours based on the idea of a circular sequence ⋮ A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space
Uses Software
This page was built for publication: The quickhull algorithm for convex hulls
