FITTING A STEP FUNCTION TO A POINT SET WITH OUTLIERS BASED ON SIMPLICIAL THICKNESS DATA STRUCTURES

DOI10.1142/S0218195912500069zbMath1267.68262MaRDI QIDQ5299999

Danny Z. Chen, Haitao Wang

Publication date: 24 June 2013

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

outliersstep functionpoints approximationsimplicial thickness queries

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms for approximation of functions (65D15) Data structures (68P05)

Cites Work

• Unnamed Item
• An approximation algorithm for least median of squares regression
• Range searching with efficient hierarchical cuttings
• The design of dynamic data structures
• On the least median square problem
• On a triangle counting problem
• On a notion of data depth based on random simplices
• A practical approximation algorithm for the LMS line estimator
• Efficient partition trees
• Cutting hyperplanes for divide-and-conquer
• Lower bounds for computing statistical depth.
• Quasi-optimal range searching in spaces of finite VC-dimension
• QUANTILE APPROXIMATION FOR ROBUST STATISTICAL ESTIMATION AND k-ENCLOSING PROBLEMS
• An on-line algorithm for fitting straight lines between data ranges
• Polygon Retrieval
• Computing the Exact Least Median of Squares Estimate and Stability Diagnostics in Multiple Linear Regression
• Fitting rectilinear polgonal curves to a set of points in the plane.

This page was built for publication: FITTING A STEP FUNCTION TO A POINT SET WITH OUTLIERS BASED ON SIMPLICIAL THICKNESS DATA STRUCTURES