Efficient piecewise-linear function approximation using the uniform metric (Q1906048): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Computing external farthest neighbors for a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting distances in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding minimal convex nested polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geodesic Voronoi diagram of point sites in a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Curve Fitting by Segmented Straight Lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3729500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming in \(O(n\times 3^{d^2})\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slowing down sorting networks to obtain faster sorting algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Merge Sort / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal-Time Algorithm for Slope Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3960030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3848301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithms for Two- and Three-Variable Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for shortest path problems in polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the visibility polygon from a convex set and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for all minimum link paths and link center problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal shortest path queries in a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fitting polygonal functions to a set of points in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new data structure for shortest path queries in a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3805737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation to Data by Splines with Free Knots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean shortest paths in the presence of rectilinear barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the link center of a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subexponential bound for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming in Linear Time When the Dimension Is Fixed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3813185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic approach to some problems in terrain navigation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Discrete Geodesic Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-link paths among obstacles in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear approximation of simple objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-dimensional linear programming and convex hulls made easy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for minimum link paths inside a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing geodesic furthest neighbors in simple polygons / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042205666 / rank
 
Normal rank

Latest revision as of 11:11, 30 July 2024

scientific article
Language Label Description Also known as
English
Efficient piecewise-linear function approximation using the uniform metric
scientific article

    Statements

    Efficient piecewise-linear function approximation using the uniform metric (English)
    0 references
    6 February 1996
    0 references
    parametric-searching technique
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers