Data reduction of large vector graphics

No abstract is available for this paper.

• Publication year

  2005

• Venue

  Pattern Recognition

• Publication date

  2005-03-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.patcog.2004.07.005
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Min-# polygonal approximation of closed curves

  2005cited by this paper
• Ant colony search algorithms for optimal polygonal approximation of plane curves

  2003cited by this paper
• Reduced-search dynamic programming for approximation of polygonal curves

  2003influential reference
• Assessing the behaviour of polygonal approximation algorithms

  2003cited by this paper
• An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves

  2002cited by this paper
• Optimal polygonal approximation of digitized curves using the sum of square deviations criterion

  2002cited by this paper
• Bidimensional Shapes Polygonalization by ACO

  2002cited by this paper
• Moment-based methods for polygonal approximation of digitized curves

  2002cited by this paper
• An efficient evolutionary algorithm for accurate polygonal approximation

  2001cited by this paper
• Moment-Based Methods for Polygonal Approximation of Digitized Curves

  2001cited by this paper
• Optimal polygonal approximation of digital planar curves using meta heuristics

  2001cited by this paper
• An adaptive split-and-merge method for binary image contour data compression

  2001cited by this paper
• An efficient algorithm for the optimal polygonal approximation of digitized curves

  2001influential reference
• Efficiently Approximating Polygonal Paths in Three and Higher Dimensions

  2001cited by this paper
• A Tabu Search Approach to Polygonal Approximation of Digital Curves

  2000cited by this paper
• Efficient polygon approximations for shape signatures

  1999cited by this paper
• Convexity Rule for Shape Decomposition Based on Discrete Contour Evolution

  1999cited by this paper
• Polygonal Approximation Using Genetic Algorithms

  1999cited by this paper
• MPEG-4 and rate-distortion-based shape-coding techniques

  1998cited by this paper
• An optimal polygonal boundary encoding scheme in the rate distortion sense

  1998influential reference
• Compression of image contours using combinatorial optimization

  1998cited by this paper
• A new method for polygonal approximation using genetic algorithms

  1998cited by this paper
• Boundary simplification using a multiscale dominant-point detection algorithm

  1998cited by this paper
• An optimal line segment extraction algorithm for online Chinese character recognition using dynamic programming

  1998cited by this paper
• Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space

  1998cited by this paper
• Cartographic line simplification and polygon CSG formulæ in O(nlog * n) time

  1998cited by this paper
• Reliable polygonal approximations of imaged real objects through dominant point detection

  1998cited by this paper
• Techniques for Assessing Polygonal Approximations of Curves

  1997cited by this paper
• Cartographic Line Simplification and Polygon CSG Formulae and in O(n log* n) Time

  1997cited by this paper
• Optimal polygonal approximation of digitised curves

  1997cited by this paper
• Approximation of Polygonal Curves with Minimum Number of Line Segments or Minimum error

  1996cited by this paper
• Polygonal approximation of digital curve by graduate iterative merging

  1995cited by this paper
• On Critical Point Detection of Digital Shapes

  1995cited by this paper
• An algorithm for polygonal approximation based on iterative point elimination

  1995cited by this paper
• A non-parametric sequential method for polygonal approximation of digital curves

  1994cited by this paper
• Optimum polygonal approximation of digitized curves

  1994influential reference
• Optimal polygonal approximation of digital curves

  1994cited by this paper
• New polygonal approximation schemes for object shape representation

  1993cited by this paper
• Polygonal approximation by boundary reduction

  1993cited by this paper
• Line generalisation by repeated elimination of points

  1993cited by this paper
• On the Detection of Dominant Points on Digital Curves

  1989cited by this paper
• Computational-geometric methods for polygonal approximations of a curve

  1986cited by this paper
• Optimum Uniform Piecewise Linear Approximation of Planar Curves

  1986cited by this paper
• Optimal polygonal approximation of digital curves

  1985cited by this paper
• Polygonal approximation by the minimax method

  1982cited by this paper
• Fast polygonal approximation of digitized curves

  1980cited by this paper
• Segmentation of Plane Curves

  1974cited by this paper
• Pattern recognition

  1974cited by this paper
• An iterative procedure for the polygonal approximation of plane curves

  1972cited by this paper

• Polygonal approximation of digital planar curve using novel significant measure

  2018cites this paper
• Graphical Symbol Recognition

  2015cites this paper
• Landmark analysis of leaf shape using dynamic threshold polygonal approximation

  2015cites this paper
• Study on Mobile Spatial Service Optimization and Its Application in Forest Intelligent Management System

  2014cites this paper
• Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling

  2014cites this paper
• Perceptual encryption with compression for secure vector map data processing

  2014cites this paper
• Geometric primitive feature extraction - concepts, algorithms, and applications

  2013cites this paper
• Artistic rendering enhancing global structure

  2013cites this paper
• PRO: A Novel Approach to Precision and Reliability Optimization Based Dominant Point Detection

  2013cites this paper
• Polygonal Representation of Digital Curves

  2012cites this paper
• Management of spatial data for visualization on mobile devices

  2012cites this paper
• Assessing Error Bound For Dominant Point Detection

  2012cites this paper
• A Non-heuristic Dominant Point Detection Based on Suppression of Break Points

  2012cites this paper
• Segmentation and multi-model approximation of digital curves

  2012cites this paper
• A novel framework for making dominant point detection methods non-parametric

  2012cites this paper
• ISE-bounded polygonal approximation of digital curves

  2012cites this paper
• 4 Polygonal Representation of Digital Curves

  2012cites this paper
• A new vector data compression approach for WebGIS

  2011cites this paper
• Nonparametric polygonal and multimodel approximation of digital curves with Rate-Distortion curve modeling

  2011cites this paper
• The research on vector data compression based on multi-objective optimization algorithm

  2010cites this paper
• IFS-CoCo: Instance and feature selection based on cooperative coevolution with nearest neighbor rule

  2010cites this paper
• IMPLEMENTING A GIS APPLICATION FOR NETWORK MANAGEMENT 1

  2010cites this paper
• Fast algorithm for error-bounded compression of digital curves

  2010cites this paper
• Comparison of vector data compression algorithms in Mobile GIS

  2010cites this paper
• DCT-based vector data compression

  2010cites this paper
• General Vectorization of Line Objects in Drawn Maps

  2009cites this paper
• A Compression Error and Optimize Compression Algorithm for Vector Data

  2009cites this paper
• Research on Mobile GIS Based for Information Collection

  2009cites this paper
• GIS Based Analysis of Agro-climatic Divisions Scenarios in China

  2009cites this paper
• An Improved Algorithm of Vector Data Compression

  2009cites this paper
• Real Time Object Delimiters Extraction for Environment Representation in Driving Scenarios

  2009cites this paper
• Research and improvement of method for vector data compression based on dynamic programming: Research and improvement of method for vector data compression based on dynamic programming

  2009cites this paper
• Fast algorithm for ISE-bounded polygonal approximation

  2008cites this paper
• Constrained piecewise linear approximation of digital curves

  2008cites this paper
• Improved algorithm for vector data compression based on dynamic programming: Improved algorithm for vector data compression based on dynamic programming

  2008cites this paper
• Simultaneous localization and mapping for structured indoor environments

  2008cites this paper
• An online polygonal approximation of digital signals and curves with Dynamic Programming algorithm

  2008cites this paper
• Generalization-oriented road line segmentation by means of an artificial neural network applied over a moving window

  2008cites this paper
• Distortion-constrained compression of vector maps

  2007cites this paper
• A new approach to segmentation of 2D range scans into linear regions

  2007cites this paper
• Optimal Algorithm for Lossy Vector Data Compression

  2007cites this paper
• Polygonal approximation of closed discrete curves

  2007cites this paper
• A new computer vision algorithm for the extraction of straight and curved features of two-dimensional products

  2006cites this paper
• ON THE RESTORATION OF SEMANTIC FEATURES IN RASTER TOPOGRAPHIC IMAGES

  2006cites this paper
• ON THE RECONSTRUCTION OF SEMANTIC DATA IN RASTER MAP IMAGES

  2005cites this paper
• Optimal Encoding of Vector Data with Polygonal Approximation and Vertex Quantization

  2005cites this paper
• Extraction and Removal of Layers from Map Imagery Data

  2005cites this paper