loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Prabhudev I. Hosur 1 and Rolando A. Carrasco 2

Affiliations: 1 ClearCube Technology, United States ; 2 University of Newcastle upon Tyne, United Kingdom

ISBN: 972-8865-28-7

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.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

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

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.; A. Carrasco R. and (2005). Fast Algorithm for Optimal Polygonal Approximation of Shape Boundaries.In Proceedings of the 5th International Workshop on Pattern Recognition in Information Systems - Volume 1: PRIS, (ICEIS 2005) ISBN 972-8865-28-7, 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 - Volume 1: PRIS, (ICEIS 2005)},
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 - Volume 1: PRIS, (ICEIS 2005)
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

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.