Efficient piecewise-linear function approximation using the uniform metric
From MaRDI portal
Publication:1906048
DOI10.1007/BF02570717zbMath0841.68121OpenAlexW2042205666MaRDI QIDQ1906048
Publication date: 6 February 1996
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131413
Related Items
A flow allocation strategy for routing over multiple flow classes with an application to air cargo terminals ⋮ Finding the convex hull of a sorted point set in parallel ⋮ Area-preserving approximations of polygonal paths ⋮ Distance-preserving approximations of polygonal paths ⋮ Fitting a two-joint orthogonal chain to a point set ⋮ A unified framework for bivariate clustering and regression problems via mixed-integer linear programming ⋮ Efficient observer-dependent simplification in polygonal domains ⋮ Continuous location of dimensional structures. ⋮ Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm ⋮ Fitting a Step Function to a Point Set ⋮ Fluctuated Fitting Under the $$\ell _1$$ -metric ⋮ Unnamed Item ⋮ Multilist layering: Complexity and applications ⋮ Parallel fractional cascading on hypercube multiprocessors ⋮ Computing homotopic line simplification ⋮ Fitting a step function to a point set ⋮ Weighted Rectilinear Approximation of Points in the Plane ⋮ POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA ⋮ Streaming algorithms for line simplification
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Computing the link center of a simple polygon
- Parallel algorithms for shortest path problems in polygons
- On the geodesic Voronoi diagram of point sites in a simple polygon
- An algorithmic approach to some problems in terrain navigation
- Computing external farthest neighbors for a simple polygon
- Small-dimensional linear programming and convex hulls made easy
- A new data structure for shortest path queries in a simple polygon
- Minimum-link paths among obstacles in the plane
- Finding minimal convex nested polygons
- Computing geodesic furthest neighbors in simple polygons
- Optimal shortest path queries in a simple polygon
- A subexponential bound for linear programming
- Linear programming in \(O(n\times 3^{d^2})\) time
- Selecting distances in the plane
- Curve Fitting by Segmented Straight Lines
- A linear time algorithm for minimum link paths inside a simple polygon
- The Discrete Geodesic Problem
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- Euclidean shortest paths in the presence of rectilinear barriers
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Linear Programming in Linear Time When the Dimension Is Fixed
- Parallel Merge Sort
- An Optimal-Time Algorithm for Slope Selection
- Approximation to Data by Splines with Free Knots
- Fitting polygonal functions to a set of points in the plane
- Slowing down sorting networks to obtain faster sorting algorithms
- Parallel algorithms for all minimum link paths and link center problems
- Linear approximation of simple objects
- Computing the visibility polygon from a convex set and related problems
