Succinct data structures for approximating convex functions with applications

DOI10.1007/B11261zbMATH Open1179.68174OpenAlexW62175113MaRDI QIDQ5897092FDOQ5897092

Luc Devroye, Pat Morin, Prosenjit Bose

Publication date: 5 February 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11261

Recommendations

• Optimal approximate polytope membership
• Approximate convex hull of data streams
• Succinct and Implicit Data Structures for Computational Geometry
• Approximate polytope membership queries
• Approximating convex functions via non-convex oracles under the relative noise model

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex functions and convex programs in convex geometry (52A41)

This page was built for publication: Succinct data structures for approximating convex functions with applications

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