The implementation of an algorithm to find the convex hull of a set of three-dimensional points

DOI10.1145/77635.77640MaRDI QIDQ3358263zbMATHOpenAlexWikidataFDO

Authors A. M. Day

Publication date 1990

Published in ACM Transactions on Graphics (Search for Journal in Brave)

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

zbMATH Keywords

triangulationtetrahedrondivide and conquerobject modellingedge structureimplementation in Pascalthree-dimensional convex hull algorithm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04)

Recommendations

• A new algorithm for computing the convex hull of a planar point set
• A simple algorithm for building the 3-D convex hull
• An efficient convex hull algorithm for finite point sets in 3D based on the method of orienting curves
• scientific article; zbMATH DE number 742638
• A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS
• Implementation of the convex polygon triangulation algorithm
• A direct method for determining the lower convex hull of a finite point set in 3D
• Convex-hull algorithms: implementation, testing, and experimentation
• An algorithm for constructing the convex hull of a set of spheres in dimension \(d\)

Cited in

(12)

• An efficient convex hull algorithm for finite point sets in 3D based on the method of orienting curves
• A memetic algorithm to schedule planned maintenance for the national grid
• A Robust Implementation for Three-Dimensional Delaunay Triangulations
• Combinatorial Image Analysis
• Topology-oriented construction of three-dimensional convex hulls
• Convex-hull algorithms: implementation, testing, and experimentation
• Convex hull of a planar set of straight and circular line segments
• A multi-dimensional unified concavity and convexity detection method based on geometric algebra
• A direct method for determining the lower convex hull of a finite point set in 3D
• Algorithms to determine the edges of a convex hull from its vertices
• Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\)
• A simple algorithm for building the 3-D convex hull

This page was built for publication: The implementation of an algorithm to find the convex hull of a set of three-dimensional points

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