Streaming algorithms for line simplification (Q5919922): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient algorithms for approximating polygonal chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A space-optimal data-stream algorithm for coresets in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-linear time approximation algorithms for curve simplification / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient piecewise-linear function approximation using the uniform metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS / 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: Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time / 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: Q3425115 / rank
 
Normal rank

Latest revision as of 16:57, 2 July 2024

scientific article; zbMATH DE number 5691954
Language Label Description Also known as
English
Streaming algorithms for line simplification
scientific article; zbMATH DE number 5691954

    Statements

    Streaming algorithms for line simplification (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 April 2010
    0 references
    0 references
    line simplification
    0 references
    streaming algorithms
    0 references
    0 references