Polygonal approximation of 2-D shapes through boundary merging期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

Polygonal approximation of 2-D shapes through boundary merging

Affiliation:	1. Fakultät für Mathematik, Universität Bielefeld, Postfach 100131, Bielefeld 33501, Germany;2. MICS, CentraleSupélec, Université Paris Saclay, 3 rue Joliot Curie, Gif-sur-Yvette 91190, France;3. Faculty of Engineering and Information Technology, University of Pécs, Pécs, Hungary;4. MICS, Univérsité Paris-Saclay, Campus de Gif-sur-Yvette, Plateau de Moulon, 3 rue Joliot Curie, Gif-sur-Yvette 91190, France;5. Peoples Friendship University of Russia (RUDN University), 6 Miklukho-Maklaya St, Moscow 117198, Russian Federation;6. Department of Mathematics, University of Connecticut, Storrs, CT 06269-1009, USA;1. Department of Computer Science, Abdul Wali Khan University Mardan, KP, Pakistan;2. Department of Compute Science, Islamia College University, Peshawar, Pakistan

Abstract:	In this paper we present a shape approximation method which yields accurate and unique polygonal approximations. The approach first looks for arcs with two or three runs along the shape boundary whose arc-to-chord deviations are not only the smallest in their local areas but also smaller than a tolerance value. These arcs are then replaced by their respective chords. This process goes on iteratively until no arc can be reduced for the given tolerance.

Keywords:
本文献已被 ScienceDirect 等数据库收录！