APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
From MaRDI portal
Publication:4880210
DOI10.1142/S0218195996000058zbMATH Open0851.68110MaRDI QIDQ4880210FDOQ4880210
Authors:
Publication date: 10 November 1996
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Recommendations
Cited In (37)
- Title not available (Why is that?)
- Global Curve Simplification
- Farthest-point queries with geometric and combinatorial constraints
- Approximation of a closed polygon with a minimum number of circular arcs and line segments
- Polygonal chain approximation: A query based approach
- Speeding up simplification of polygonal curves using nested approximations
- Computing melodic templates in oral music traditions
- Distance-preserving approximations of polygonal paths
- Suboptimal solutions to the algebraic-error line triangulation
- Structural, Syntactic, and Statistical Pattern Recognition
- Progressive simplification of polygonal curves
- Title not available (Why is that?)
- Data reduction of large vector graphics
- Embedding ray intersection graphs and global curve simplification
- Fitting a two-joint orthogonal chain to a point set
- SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
- Continuous location of dimensional structures.
- Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling
- CIM algorithm for approximating three-dimensional polygonal curves
- Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
- An efficient algorithm for the optimal polygonal approximation of digitized curves
- Extremal point queries with lines and line segments and related problems
- Area-preserving approximations of polygonal paths
- On optimal polyline simplification using the Hausdorff and Fréchet distance
- The equipartition of curves
- Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs
- Polygonal path simplification with angle constraints
- Consistent simplification of polyline tree bundles
- Representing a functional curve by curves with fewer peaks
- Reduced-search dynamic programming for approximation of polygonal curves
- An efficient evolutionary algorithm for accurate polygonal approximation
- Efficient algorithms for 3-D polygonal approximation based on LISE criterion
- Polygonal approximation of closed discrete curves
- Optimal simplification of polygonal chains for subpixel-accurate rendering
- Place the vertices anywhere on the curve and simplify
- Approximating Polygonal Curves in Two and Three Dimensions
- Fitting rectilinear polgonal curves to a set of points in the plane.
This page was built for publication: APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4880210)
