Polygonal approximation of closed contours with minimum number of segments can be found by applying optimal algorithm for the open curves repeated for all possible starting points, or by using heuristic adjustment of the starting point. A better approach, however, is to extend the optimal algorithm from open to closed curves by extending the search space circularly. In this paper, we adopt this idea to the case of min-# problem. The proposed algorithm finds the optimal solution in less than 1.5 times of the time required by the open curve.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Min-# polygonal approximation of closed curves


    Contributors:
    Kolesnikov, A. (author) / Franti, P. (author)


    Publication date :

    2005-01-01


    Size :

    138902 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Min-# Polygonal Approximation of Closed Curves

    Kolesnikov, A. / Franti, P. | British Library Conference Proceedings | 2005



    CLOSED POLYGONAL WING MEMBER AND USES THEREOF

    FAINVEITS (LUKASHOV) VASILII / SERGEI LOBANOV / SERGEJS TIMOFEJEVS | European Patent Office | 2024

    Free access

    CLOSED POLYGONAL WING MEMBER AND USES THEREOF

    LUKASHOV VASILII / SERGEI LOBANOV / SERGEJS TIMOFEJEVS | European Patent Office | 2023

    Free access

    Approximating Polygonal Curves in Two and Three Dimensions

    Miyaoku, K. / Harada, K. | British Library Online Contents | 1998