Convex hull algorithms
Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science, see "Convex hull applications".
Convex hull algorithmsKirkpatrick–Seidel algorithmConvex hullChan's algorithmGift wrapping algorithmGraham scanConvex polytopeDynamic convex hullKinetic convex hullOutput-sensitive algorithmCGALOrthogonal convex hullShapley–Folkman lemmaQuickHullDouble exponential functionMinkowski additionComputer-assisted gamingList of algorithmsTimothy M. ChanRaimund Seidel
K-set (geometry)Minimum bounding box algorithmsContext of computational complexityConvex and concave polygonsPseudotriangleList of books in computational geometryScanKinetic diameterSmallest circle problemRectilinear polygonKinetic minimum boxRandomized algorithmJohn von NeumannList of geometry topicsJTS Topology SuiteTight spanEuclidean minimum spanning treeDavid AvisDuality (optimization)Frameworks supporting the polyhedral model
Our Services
Do not forget to check the lastest products and auctions related to Convex Hull Algorithms as well as our free videos and podcasts.
