A direct method for determining the lower convex hull of a finite point set in 3D

DOI10.1007/978-3-319-17996-4_2zbMATH Open1336.68266OpenAlexW981962503WikidataQ57659429 ScholiaQ57659429MaRDI QIDQ2808066FDOQ2808066

Authors: Thanh An Phan, Thanh Giang Dinh 

Publication date: 26 May 2016

Published in: Advanced Computational Methods for Knowledge Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-17996-4_2

Recommendations

• An efficient convex hull algorithm for finite point sets in 3D based on the method of orienting curves
• scientific article; zbMATH DE number 7499212
• scientific article; zbMATH DE number 2123362
• The quickhull algorithm for convex hulls
• scientific article; zbMATH DE number 724218

zbMATH Keywords

pattern recognitionconvex hullVoronoi diagramextreme edgegift-wrapping algorithmlower convex hull

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Computational Geometry in C
• Title not available (Why is that?)
• Voronoi diagrams on the sphere
• An efficient convex hull algorithm for finite point sets in 3D based on the method of orienting curves
• 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

Cited In (3)

• Title not available (Why is that?)
• An effective method to determine whether a point is within a convex hull and its generalized convex polyhedron classifier
• The implementation of an algorithm to find the convex hull of a set of three-dimensional points

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)