Fast Algorithm for Optimal Polygonal Approximation of Shape Boundaries

Prabhudev I. Hosur; Rolando A. Carrasco

Research.Publish.Connect.

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

Fast Algorithm for Optimal Polygonal Approximation of Shape Boundaries

In Proceedings of the 5th International Workshop on Pattern Recognition in Information Systems - Volume 0ICEIS, 104-113, 2005 , Miami, United States

Authors: Prabhudev I. Hosur ¹ and Rolando A. Carrasco ²

Affiliations: ¹ ClearCube Technology, United States ; ² University of Newcastle upon Tyne, United Kingdom

Abstract: This paper presents fast optimal algorithm for approximation of a shape boundary with a polygon having minimum number of vertices for a given maximum tolerable approximation error. For this purpose, the directed acyclic graph (DAG) formulation of the polygonal approximation problem is considered. The reduction in computational complexity is achieved by reducing the number of admissible edges in the DAG and speeding up the process of determining whether the edge distortion is within the tolerable limit. The proposed algorithm is compared with other optimal algorithms in terms of the execution time.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 18.219.236.62

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

I. Hosur, P. and A. Carrasco, R. (2005). Fast Algorithm for Optimal Polygonal Approximation of Shape Boundaries. In Proceedings of the 5th International Workshop on Pattern Recognition in Information Systems (ICEIS 2005) - PRIS; ISBN 972-8865-28-7, SciTePress, pages 104-113. DOI: 10.5220/0002579501040113

@conference{pris05,
author={Prabhudev {I. Hosur}. and Rolando {A. Carrasco}.},
title={Fast Algorithm for Optimal Polygonal Approximation of Shape Boundaries},
booktitle={Proceedings of the 5th International Workshop on Pattern Recognition in Information Systems (ICEIS 2005) - PRIS},
year={2005},
pages={104-113},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002579501040113},
isbn={972-8865-28-7},
}

TY - CONF

JO - Proceedings of the 5th International Workshop on Pattern Recognition in Information Systems (ICEIS 2005) - PRIS
TI - Fast Algorithm for Optimal Polygonal Approximation of Shape Boundaries
SN - 972-8865-28-7
AU - I. Hosur, P.
AU - A. Carrasco, R.
PY - 2005
SP - 104
EP - 113
DO - 10.5220/0002579501040113
PB - SciTePress