53 search results - page 1 / 11 » Efficient Algorithms for Approximating Polygonal Chains |
91
Voted
DCG
2000
14 years 9 months ago
2000
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
ICIP
1997
IEEE
15 years 11 months ago
1997
IEEE
In this paper, we present a fast and optimal method for the lossy encoding of object boundaries which are given as 8-connect chain codes. We approximate the boundary by a polygon ...
MVA
2007
14 years 11 months ago
2007
This paper presents a new approach to extracting and representing structural features of images. The approach is based on both a region-based analysis and a contour-based analysis...
86
Voted
COMGEO
2008
ACM
14 years 9 months ago
2008
ACM
We present an algorithm for approximating a given open polygonal curve with a minimum number of circular arcs. In computer-aided manufacturing environments, the paths of cutting t...
ICPR
2010
IEEE
14 years 7 months ago
2010
IEEE
A novel stochastic searching scheme based on the Monte Carlo optimization is presented for polygonal approximation (PA) problem. We propose to combine the split-and-merge based lo...