scientific article; zbMATH DE number 1947379

MaRDI QIDQ4411343zbMATH OpenFDO

Authors Nabil H. Mustafa, Yusu Wang, Pankaj K. Agarwal, Sariel Har-Peled

Publication date 8 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2461/24610029.htm

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Approximation algorithms (68W25)

Recommendations

• Near-linear time approximation algorithms for curve simplification
• A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance
• SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
• scientific article; zbMATH DE number 1222818
• Efficient algorithms for approximating polygonal chains

Cited in

(27)

• Linear-time algorithms for testing the realisability of line drawings of curved objects
• Universal approximate simplification under the discrete Fréchet distance
• Efficient algorithms for approximating polygonal chains
• Progressive simplification of polygonal curves
• Polygonal path simplification with angle constraints
• SimpliPoly: curvature-based polygonal curve simplification
• Robust nonparametric simplification of polygonal chains
• A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance
• scientific article; zbMATH DE number 2185597 (Why is no real title available?)
• On optimal polyline simplification using the Hausdorff and Fréchet distance
• scientific article; zbMATH DE number 3938424 (Why is no real title available?)
• Reduced-search dynamic programming for approximation of polygonal curves
• SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
• APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
• Robust nonparametric data approximation of point sets via data reduction
• Global Curve Simplification
• Polyline simplification has cubic complexity
• On optimal polyline simplification using the Hausdorff and Fréchet distance
• Place the vertices anywhere on the curve and simplify
• Polyline simplification has cubic complexity
• Streaming algorithms for line simplification
• Streaming algorithms for line simplification
• Approximating ( k,ℓ )-Median Clustering for Polygonal Curves
• Polygonal chain approximation: A query based approach
• Speeding up simplification of polygonal curves using nested approximations
• Near-linear time approximation algorithms for curve simplification
• Optimal simplification of polygonal chains for subpixel-accurate rendering

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411343)