On approximating the depth and related problems

MaRDI QIDQ2921754zbMATH OpenFDO

Authors Boris Aronov, Sariel Har-Peled

Publication date 13 October 2014

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25)

Recommendations

• On Approximating the Depth and Related Problems
• On approximate range counting and depth
• On approximate range counting and depth
• Approximate halfspace range counting
• Algorithms for polytope covering and approximation

Cited in

(15)

• Probabilistic matching of planar regions
• A lower bound for computing Oja depth
• A characterization of halfspace depth
• Computation of depth in \(C(X)\)
• Stabbing Convex Polygons with a Segment or a Polygon
• Shape Matching by Random Sampling
• On Approximating the Depth and Related Problems
• Approximating majority depth
• Shape matching by random sampling
• On Combinatorial Depth Measures
• On approximate range counting and depth
• Robust shape fitting via peeling and grating coresets
• On the depth r Bernstein projector
• Covering point sets with two disjoint disks or squares
• A general approach for cache-oblivious range reporting and approximate range counting

This page was built for publication: On approximating the depth and related problems

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