Space-efficient algorithms for approximating polygonal curves in two dimensional space
From MaRDI portal
Recommendations
- SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
- Approximating Polygonal Curves in Two and Three Dimensions
- An efficient algorithm for the optimal polygonal approximation of digitized curves
- An optimal algorithm for polygonal approximation of digitized curves
- Approximating polygons for space-filling curves generated with P systems
- scientific article; zbMATH DE number 4074316
- An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves
- Reduced-search dynamic programming for approximation of polygonal curves
- EFFICIENT APPROXIMATION OF CONVEX POLYGONS
Cited in
(14)- Efficient algorithms for 3-D polygonal approximation based on LISE criterion
- Efficient algorithms for approximating polygonal chains
- Efficient representation in spaces of plane curves
- On the 2-central path problem
- scientific article; zbMATH DE number 4074316 (Why is no real title available?)
- scientific article; zbMATH DE number 1189346 (Why is no real title available?)
- Approximating Polygonal Curves in Two and Three Dimensions
- Near-linear time approximation algorithms for curve simplification
- 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
- Speeding up simplification of polygonal curves using nested approximations
- Near-linear time approximation algorithms for curve simplification
- The equipartition of curves
This page was built for publication: Space-efficient algorithms for approximating polygonal curves in two dimensional space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4218406)