Data reduction of large vector graphics
From MaRDI portal
Publication:1765582
DOI10.1016/j.patcog.2004.07.005zbMath1061.68169OpenAlexW2121602604MaRDI QIDQ1765582
Pasi Fränti, Alexander V. Kolesnikov
Publication date: 23 February 2005
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2004.07.005
Dynamic programmingPolygonal approximationData reductionMin-e problemMultiple-objectVector data compression
Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (4)
Polygonal approximation of closed discrete curves ⋮ Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling ⋮ Generalization-oriented road line segmentation by means of an artificial neural network applied over a moving window ⋮ IFS-CoCo: instance and feature selection based on cooperative coevolution with nearest neighbor rule
Cites Work
- Unnamed Item
- Unnamed Item
- Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time
- Ant colony search algorithms for optimal polygonal approximation of plane curves.
- Efficiently approximating polygonal paths in three and higher dimensions
- An efficient algorithm for the optimal polygonal approximation of digitized curves
- An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves
- Polygonal approximation by the minimax method
- A new method for polygonal approximation using genetic algorithms
- Polygonal approximation by boundary reduction
- A non-parametric sequential method for polygonal approximation of digital curves
- Optimum polygonal approximation of digitized curves
- Reduced-search dynamic programming for approximation of polygonal curves
- An optimal polygonal boundary encoding scheme in the rate distortion sense
- Segmentation of Plane Curves
- An adaptive split-and-merge method for binary image contour data compression
- SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
- APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
- Optimal polygonal approximation of digital planar curves using meta heuristics
- An efficient evolutionary algorithm for accurate polygonal approximation
- Moment-based methods for polygonal approximation of digitized curves
- Optimal polygonal approximation of digitized curves using the sum of square deviations criterion
This page was built for publication: Data reduction of large vector graphics
