Outlier respecting points approximation
From MaRDI portal
Publication:517798
DOI10.1007/s00453-012-9738-zzbMath1360.68869OpenAlexW1994842503MaRDI QIDQ517798
Publication date: 27 March 2017
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-012-9738-z
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On an instance of the inverse shortest paths problem
- Finding the intersection of two convex polyhedra
- \(k\)-violation linear programming
- Computation of the reverse shortest-path problem
- Output-sensitive results on convex hulls, extreme points, and related problems
- Inverse combinatorial optimization: a survey on problems, methods, and results
- On geometric optimization with few violated constraints
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- Fitting a Step Function to a Point Set
- Inverse Optimization
- Approximating Points by a Piecewise Linear Function: I
- Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers
- A linear algorithm for determining the separation of convex polyhedra
- Linear Programming in Linear Time When the Dimension Is Fixed
- An on-line algorithm for fitting straight lines between data ranges
- Optimal Search in Planar Subdivisions
- Convex hulls of finite sets of points in two and three dimensions
- Data-streams and histograms
- AN OPTIMAL ALGORITHM FOR COMPUTING (≤K)-LEVELS, WITH APPLICATIONS
- Fitting rectilinear polgonal curves to a set of points in the plane.
- An improved bound for \(k\)-sets in three dimensions
This page was built for publication: Outlier respecting points approximation
