| 摘要 |
PURPOSE:To speed up processing by integrating an original concave polyhedron by extracting concave regions of the concave polyhedron and closing these concave regions with planes to form convex regions, ending the processing if the integrated polyhedron is a convex polyhedron, and when it is still a concave polyhedron, repeating the same processing again to form a smallest enclosing convex polyhedron of the concave polyhedron. CONSTITUTION:All concave regions of an inputted polyhedron are extracted, whether one or more concave regions extracted by a concave region extracting part 1 exist or not is decided, and when there is no concave region, the polyhedron is regarded as a convex polyhedron and the processing is ended. When a concave region exists, the concave region extracted by the extracting part 1 is closed with a plan to convert it convex. Whether the convex enclosing of the concave region transferred from an end condition deciding part 2 is completely ended or not is decided, and if the processing is not ended, said processing is repeated, and when the convex enclosing processing has been completed, individual concave regions are replaced and respective planes of convex enclosure to form an intermediate polyhedron. Since the convex enclosing processing is applied only to the concave regions, useless processing can be omitted and the processing speed for a concave polyhedron having small concave regions can be increased.
|
