Approximating Polygonal Curves in Two and Three Dimensions
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4074316
- On the approximation of curves with polylines
- Polygonal approximation of closed discrete curves
- APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
- scientific article; zbMATH DE number 3105840
- Approximation by polynomial splines on curved triangulations
- Optimum polygonal approximation of digitized curves
- scientific article; zbMATH DE number 1222818
Cited in
(15)- Approximation of high-degree and procedural curves
- Straightening polygonal arcs and convexifying polygonal cycles
- Efficiently approximating polygonal paths in three and higher dimensions
- On properties of analytical approximation for discretizing 2D curves and 3D surfaces
- Polygonal approximation of digital planar curves through vertex betweenness
- Polygonal approximation of flows
- scientific article; zbMATH DE number 437533 (Why is no real title available?)
- scientific article; zbMATH DE number 1189346 (Why is no real title available?)
- scientific article; zbMATH DE number 1222818 (Why is no real title available?)
- Distance approximations for rasterizing implicit curves
- APPROXIMATING 3D POINTS WITH CYLINDRICAL SEGMENTS
- Approximation of Large Bending Isometries with Discrete Kirchhoff Triangles
- Structural, Syntactic, and Statistical Pattern Recognition
- CIM algorithm for approximating three-dimensional polygonal curves
- Area-preserving approximations of polygonal paths
This page was built for publication: Approximating Polygonal Curves in Two and Three Dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4216036)
