Approximating points by a piecewise linear function
From MaRDI portal
Publication:2375945
Recommendations
- Approximating points by a piecewise linear function: I
- Approximation by means of piecewise linear functions
- Piece-wise linear approximation of functions of two variables
- Piecewise-linear approximations of multidimensional functions
- Piecewise linear approximation of smooth functions of two variables
- Piecewise linear approximation of smooth functions of two variables
- Approximating points by a piecewise linear function: II. Dealing with outliers
- scientific article; zbMATH DE number 1873136
- scientific article; zbMATH DE number 3303580
Cites work
- k-violation linear programming
- A linear algorithm for determining the separation of convex polyhedra
- A new algorithm for fitting a rectilinear x-monotone curve to a set of points in the plane
- An on-line algorithm for fitting straight lines between data ranges
- An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Approximate dynamic programming using halfspace queries and multiscale Monge decomposition
- Approximating points by a piecewise linear function: II. Dealing with outliers
- Approximation algorithms for MAX–MIN tiling
- Combinatorial Optimization with Rational Objective Functions
- COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS
- Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming
- Efficient approximation algorithms for tiling and packing problems with rectangles
- Efficiently approximating polygonal paths in three and higher dimensions
- Exact size of binary space partitionings and improved rectangle tiling algorithms
- Fast Algorithms for Finding Nearest Common Ancestors
- Finding the intersection of two convex polyhedra
- Fitting a Step Function to a Point Set
- Fitting polygonal functions to a set of points in the plane
- Fitting rectilinear polgonal curves to a set of points in the plane.
- Fractional cascading. I: A data structuring technique
- Generalized Selection and Ranking: Sorted Matrices
- Geometric applications of a matrix-searching algorithm
- scientific article; zbMATH DE number 432817 (Why is no real title available?)
- scientific article; zbMATH DE number 29716 (Why is no real title available?)
- scientific article; zbMATH DE number 1303579 (Why is no real title available?)
- scientific article; zbMATH DE number 1305473 (Why is no real title available?)
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- scientific article; zbMATH DE number 2119697 (Why is no real title available?)
- Introduction to algorithms
- Linear Programming in Linear Time When the Dimension Is Fixed
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- Maintenance of configurations in the plane
- Making data structures persistent
- Measurement Error in a Random Walk Model with Applications to Population Dynamics
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- On geometric optimization with few violated constraints
- Optimal Search in Planar Subdivisions
- Output-sensitive results on convex hulls, extreme points, and related problems
- Planar Formulae and Their Uses
- Representing a functional curve by curves with fewer peaks
- Separation and approximation of polyhedral objects
- Slowing down sorting networks to obtain faster sorting algorithms
- Surface Approximation and Geometric Partitions
Cited in
(18)- Chebyshev approximation of a point set by a straight line
- On the performance of learned data structures
- Weighted \(L_{\infty}\) isotonic regression
- Rectilinear Approximation of a Set of Points in the Plane
- Approximating points by a piecewise linear function: I
- Approximating points by a piecewise linear function: II. Dealing with outliers
- scientific article; zbMATH DE number 1323022 (Why is no real title available?)
- A piecewise linear approximation method preserving visual feature points of original figures
- scientific article; zbMATH DE number 740121 (Why is no real title available?)
- scientific article; zbMATH DE number 1003231 (Why is no real title available?)
- scientific article; zbMATH DE number 1163563 (Why is no real title available?)
- Fluctuated fitting under the \(\ell _1\)-metric
- Efficient algorithms for the one-dimensional \(k\)-center problem
- An \(O(n\log n)\)-time algorithm for the \(k\)-center problem in trees
- Piecewise-linear approximations of uncertain functions
- An O(n n)-time algorithm for the k-center problem in trees
- Algorithms for subpath convex hull queries and ray-shooting among segments
- Capturing the shape of a point set with a line segment
This page was built for publication: Approximating points by a piecewise linear function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2375945)
