Improved points approximation algorithms based on simplicial thickness data structures

DOI10.1007/978-3-642-19222-7_36zbMATH Open1326.68305OpenAlexW1556155138MaRDI QIDQ3000523FDOQ3000523

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

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

Mathematics Subject Classification ID

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

Cites Work

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

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)