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

DOI10.1145/77635.77640zbMath0732.68098OpenAlexW1964233522WikidataQ128028533 ScholiaQ128028533MaRDI QIDQ3358263

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

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

Related Items (3)

Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\) ⋮ A Direct Method for Determining the Lower Convex Hull of a Finite Point Set in 3D ⋮ An efficient convex hull algorithm for finite point sets in 3D based on the Method of Orienting Curves

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