Publications
Search

Publications :: Search

S URVEY O N P OLYGONAL A PPROXIMATION T ECHNIQUES F OR D IGITAL P LANAR C URVES

Show publication

On this page you see the details of the selected publication.

    Publication properties
    Title: S URVEY O N P OLYGONAL A PPROXIMATION T ECHNIQUES F OR D IGITAL P LANAR C URVES
    Rating: (not rated yet)
    Discussion: 0 comments
    Date: 5 / 2013
    Publication type: Journal article
    Authors:
    No. First name Last name Show
    1. Kalaivani Selvakumar
    Bookmark:

    The following keywords have been assigned to this publication so far. If you have logged in, you can tag this publication with additional keywords.

    Keywords
    1. P olygon approximation
    2. contour points
    3. digital planar curves
    4. dominant points

    If you log in you can tag this publication with additional keywords

    A publication can refer to another publication (outgoing references) or it can be referred to by other publications (incoming references).

    Incoming References
    No incoming references have been assigned to this publication yet.
    Outgoing References
    No outgoing references have been assigned to this publication yet.

    If you log in you can add references to other publications

    A publication can be assigned to a conference, a journal or a school.

    Venue
    This publication has not been assigned to a venue.

    Abstract

    Polygon approximation plays a vital role in abquitious applications like multimedia, geographic and object recognition. An extensive number of polygonal approximation techniques for digital planar curves have b een proposed over th e last decade, but there are no survey papers o n recently proposed techniques. Polygon is a collection of edges and vertices. Objects are represented using edges and vertices or contour points (ie. p olygon) . Polygonal approxi mation is representing the o bje ct with less number of dominant points (less number of edges and vertices) . Polygon approximation results in less computation al speed and memory usage . This paper deals with compar ative study on polygonal approximation techniques for digital planar curves with respect to their computation and efficiency