Self-improving algorithms for convex hulls

MaRDI QIDQ5417730zbMATH OpenFDO

Authors Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri

Publication date 22 May 2014

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Self-improving algorithms for coordinatewise maxima and convex hulls
• Self-improving algorithms
• Self-improving algorithms for coordinate-wise maxima
• Self-improving algorithms for delaunay triangulations
• scientific article; zbMATH DE number 17632

Cited in

(9)

• Applications of a semi-dynamic convex hull algorithm
• Extensions of self-improving sorters
• Self-improving algorithms for coordinate-wise maxima
• Self-improving algorithms
• scientific article; zbMATH DE number 2089211 (Why is no real title available?)
• Adaptive algorithms for planar convex hull problems
• Self-improving algorithms for delaunay triangulations
• A PAC Approach to Application-Specific Algorithm Selection
• Self-improving algorithms for coordinatewise maxima and convex hulls

This page was built for publication: Self-improving algorithms for convex hulls

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5417730)