1. A new concave polygon convex decomposition algorithm for rapid prototyping subarea scanning was proposed.

2. The triangulating and filling of concave polygon could be widely applied in computer graphics and the field of 3D modeling in geosciences problems.

3. Exactly based on this idea, sub-model decomposition approach to concave polygon and hierarchical model weighted measure are presented.

4. This paper gives an algorithm of crossings between horizontal lines and the boundaries of a concave polygon by means of mere addition and subtraction.

5. No algorithm for line clipping based on a generalized polygon (or concave polygon) is available in the literature.