scientific article; zbMATH DE number 4085023

MaRDI QIDQ3814809zbMATH OpenFDO

Authors C. E. Buckley

Publication date 1988

zbMATH Keywords

convex hullDelaunay triangulationsdivide- and-conquergeometric data structure

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Polytopes and polyhedra (52Bxx) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• An approximate algorithm for computing multidimensional convex hulls
• A Complete Implementation for Computing General Dimensional Convex Hulls
• The quickhull algorithm for convex hulls
• Computing D-convex hulls in the plane
• Computing convex quadrangulations
• Computing convex quadrangulations
• An optimal convex hull algorithm in any fixed dimension
• A new algorithm for computing the convex hull of a planar point set
• An efficient and numerically correct algorithm for the 2D convex hull problem

Cited in

(5)

• Robust gift wrapping for the three-dimensional convex hull
• Three-dimensional unstructured mesh generation. I: Fundamental aspects of triangulation and point creation
• Representing geometric structures in \(d\) dimensions: Topology and order
• A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case
• A general solution for robust linear programs with distortion risk constraints

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3814809)