Polygonal approximation of digital planar curves through break point suppression (Q733122): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.patcog.2009.06.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2072072559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Curvature and Tangential Deflection of Discrete Arcs: A Theory Based on the Commutator of Scatter Matrix Pairs and Its Application to Vertex Detection in Planar Shape Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corner detection and curve segmentation by multiresolution chain-code linking / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2D object recognition based on curvature functions obtained from local histograms of the contour chain code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another look at the dominant point detection of digital curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: A curve bend function based method to characterize contour shapes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coarse-to-fine planar object identification using invariant curve features and \(B\)-spline modeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chord-to-point distance accumulation and planar curvature: a new approach to discrete curvature / rank
 
Normal rank
Property / cites work
 
Property / cites work: An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving fitting quality of polygonal approximation by using the dynamic programming technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar shape recognition by directional flow-change method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for dominant points detection and polygonization of digital curves. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimized polygonal approximation by dominant point deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extraction of dominant points by estimation of the contour fluctuations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum polygonal approximation of digitized curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: ACORD -- an adaptive corner detector for planar curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the optimal polygonal approximation of digitized curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal polygonal approximation of digitized curves using the sum of square deviations criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-parametric planar shape representation based on adaptive curvature functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive method for detecting dominant points. / rank
 
Normal rank

Latest revision as of 02:05, 2 July 2024

scientific article
Language Label Description Also known as
English
Polygonal approximation of digital planar curves through break point suppression
scientific article

    Statements

    Polygonal approximation of digital planar curves through break point suppression (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 October 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    digital planar curves
    0 references
    polygonal approximation
    0 references
    dominant points
    0 references
    0 references