New Approach for Decomposing a Polygon Based on Approximate Convex Decomposition

Decomposition of polygon is one of the most fundamental problems in geometry processing and computational geometry.It has a very wide range of applications in engineering.Based on the strategy of approximate convex decomposition (ACD), we propose an approach for decomposing a polygon.Firstly, we propose a novel approach for measurement of concavity about vertex of polygon, to resolve the feature points (notches) of polygon accurately and to reflect natural visual meaning more availably.In the process of partition, we take several restrictive measures to ensure the resulting components have elegant shape, and the over-all layout of decomposition is aesthetic.In addition, we introduce a new method for estimating the threshold to meet the needs of the user.Our approach is faster, more efficient than most of other approaches, and could generate much less components than that of many other approaches.Many experimental results are presented to show the applicability of our approach, which is that our approach could not only decompose a polygon more accurately, more effectively, and more quickly, but also produce polished components and shapely over-all layout.