The implementation of an algorithm to find the convex hull of a set of three-dimensional points
DOI10.1145/77635.77640zbMATH Open0732.68098OpenAlexW1964233522WikidataQ128028533 ScholiaQ128028533MaRDI QIDQ3358263FDOQ3358263
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
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\)
triangulationtetrahedrondivide and conquerobject modellingedge structureimplementation in Pascalthree-dimensional convex hull algorithm
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04)
Cited In (12)
- Combinatorial Image Analysis
- A direct method for determining the lower convex hull of a finite point set in 3D
- Topology-oriented construction of three-dimensional convex hulls
- A multi-dimensional unified concavity and convexity detection method based on geometric algebra
- An efficient convex hull algorithm for finite point sets in 3D based on the method of orienting curves
- Algorithms to determine the edges of a convex hull from its vertices
- A simple algorithm for building the 3-D convex hull
- A Robust Implementation for Three-Dimensional Delaunay Triangulations
- A memetic algorithm to schedule planned maintenance for the national grid
- Convex hull of a planar set of straight and circular line segments
- Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\)
- Convex-hull algorithms: implementation, testing, and experimentation
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)
