A Linear Algorithm for Polygonal Representations of Digital Sets - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

A Linear Algorithm for Polygonal Representations of Digital Sets

Abstract

Polygonal representations of digital sets with the same convexity properties allow a simple decomposition of digital boundaries into convex and concave parts. Representations whose vertices are boundary points, i.e. are integer numbers, attract most attention. The existing linear Algorithm UpPolRep computes polygonal representations with some uncorresponding parts. However, the algorithm is unable to decide if a corresponding polygonal representation still exists and in the case of existence it is unable to compute the representation. Studying situations where uncorrespondences appear we extended the algorithm. The extention does not change the time complexity. If a digital set possesses a corresponding representation then it detects this representation. Otherwise, it recognizes that such representation does not exist.

Dates and versions

inria-00173236 , version 1 (19-09-2007)

Identifiers

Cite

Hélène Dörksen-Reiter, Isabelle Debled-Rennesson. A Linear Algorithm for Polygonal Representations of Digital Sets. 11th International Workshop on Combinatorial Image Analysis - IWCIA 2006, Jun 2006, Berlin, Germany. pp.307-319, ⟨10.1007/11774938_24⟩. ⟨inria-00173236⟩
34 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More