scientific article; zbMATH DE number 1445286

MaRDI QIDQ4952599zbMATH OpenFDO

Authors Stefan Langerman, William Steiger

Publication date 10 May 2000

zbMATH Keywords

arrangementhyperplane depthoptimal algorithm

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical mathematical programming methods (65K05)

Recommendations

• The complexity of hyperplane depth in the plane
• Optimal algorithms for geometric centers and depth
• An optimized framework for plane-probing algorithms
• An algorithm to compute the Hilbert depth
• An Optimal Algorithm for Computing Visibility in the Plane
• scientific article; zbMATH DE number 177568
• A near-optimal planarization algorithm
• An optimal algorithm for intersecting line segments in the plane
• scientific article; zbMATH DE number 21137
• An optimal convex hull algorithm in any fixed dimension

Cited in

(9)

• A practical approximation algorithm for the LMS line estimator
• Depth in an arrangement of hyperplanes
• The complexity of hyperplane depth in the plane
• The deepest regression method
• Lower bounds for computing statistical depth.
• Computing a high depth point in the plane
• scientific article; zbMATH DE number 2119711 (Why is no real title available?)
• Optimal algorithms for geometric centers and depth
• Efficient algorithms for maximum regression depth

This page was built for publication:

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