A direct method for determining the lower convex hull of a finite point set in 3D
From MaRDI portal
Publication:2808066
Recommendations
Cites work
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 1455125 (Why is no real title available?)
- scientific article; zbMATH DE number 3345859 (Why is no real title available?)
- An efficient convex hull algorithm for finite point sets in 3D based on the method of orienting curves
- Computational Geometry in C
- Robust gift wrapping for the three-dimensional convex hull
- The implementation of an algorithm to find the convex hull of a set of three-dimensional points
- Voronoi diagrams on the sphere
Cited in
(3)
This page was built for publication: A direct method for determining the lower convex hull of a finite point set in 3D
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808066)