Improved points approximation algorithms based on simplicial thickness data structures

DOI10.1007/978-3-642-19222-7_36MaRDI QIDQ3000523zbMATH OpenOpenAlexFDO

Authors Danny Z. Chen, Haitao Wang

Publication date 19 May 2011

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

Full work available at URL https://doi.org/10.1007/978-3-642-19222-7_36

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Fitting a step function to a point set with outliers based on simplicial thickness data structures
• Approximating points by a piecewise linear function: II. Dealing with outliers
• Outlier respecting points approximation
• Outlier Respecting Points Approximation
• Robust nonparametric data approximation of point sets via data reduction

Cites work

• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• An on-line algorithm for fitting straight lines between data ranges
• Approximating points by a piecewise linear function: I
• Approximating points by a piecewise linear function: II. Dealing with outliers
• Cutting hyperplanes for divide-and-conquer
• Decomposable searching problems
• Efficient partition trees
• Lower Bounds on the Complexity of Polytope Range Searching
• Polygon Retrieval
• Quasi-optimal range searching in spaces of finite VC-dimension
• Quasi-optimal upper bounds for simplex range searching and new zone theorems
• Range searching with efficient hierarchical cuttings
• The design of dynamic data structures

Cited in

(1)

• Fitting a step function to a point set with outliers based on simplicial thickness data structures

This page was built for publication: Improved points approximation algorithms based on simplicial thickness data structures

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