作者: Helene Dörksen-Reiter , Isabelle Debled-Rennesson
DOI: 10.1007/11774938_24
关键词:
摘要: Polygonal representations of digital sets with the same convexity properties allow a simple decomposition boundaries into convex and concave parts. Representations whose vertices are boundary points, i.e. integer numbers, attract most attention. The existing linear Algorithm UpPolRep computes polygonal some uncorresponding parts. However, algorithm is unable to decide if corresponding representation still exists in case existence it compute representation. Studying situations where uncorrespondences appear we extended algorithm. extention does not change time complexity. If set possesses then detects this Otherwise, recognizes that such exist.