Data reduction of large vector graphics
type: Item
instance of: scholarly article
title: Data reduction of large vector graphics
zbMATH Open document ID: 1061.68169
author: Pasi Fränti
author: Alexander V. Kolesnikov
published in: Pattern Recognition
publication date: 2005-02-23T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68U10
zbMATH DE Number: 2137536
zbMATH Keywords: Polygonal approximation
zbMATH Keywords: Multiple-object
zbMATH Keywords: Dynamic programming
zbMATH Keywords: Min-e problem
zbMATH Keywords: Data reduction
zbMATH Keywords: Vector data compression
MaRDI profile type: Publication
full work available at URL: j.patcog.2004.07.005
OpenAlex ID: W2121602604
cites work: APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
cites work: SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
cites work: Efficiently approximating polygonal paths in three and higher dimensions
cites work: Optimum polygonal approximation of digitized curves
cites work: An efficient algorithm for the optimal polygonal approximation of digitized curves
cites work: Optimal polygonal approximation of digitized curves using the sum of square deviations criterion
cites work: Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time
cites work: Polygonal approximation by boundary reduction
cites work: Moment-based methods for polygonal approximation of digitized curves
cites work: Segmentation of Plane Curves
cites work: An adaptive split-and-merge method for binary image contour data compression
cites work: Polygonal approximation by the minimax method
cites work: A non-parametric sequential method for polygonal approximation of digital curves
cites work: A new method for polygonal approximation using genetic algorithms
cites work: An efficient evolutionary algorithm for accurate polygonal approximation
cites work: Optimal polygonal approximation of digital planar curves using meta heuristics
cites work: Ant colony search algorithms for optimal polygonal approximation of plane curves.
cites work: An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves
cites work: Q4448166
cites work: An optimal polygonal boundary encoding scheme in the rate distortion sense
cites work: Reduced-search dynamic programming for approximation of polygonal curves
cites work: Q3241581
DOI: 10.1016/J.PATCOG.2004.07.005
Recommended article: Distributed Compression of Graphical Data
Recommended article: Universal Lossless Compression of Graphical Data
Recommended article: Q4792761
description: scientific article; zbMATH DE number 2137536