convex polygon造句
1 Draws a single, convex polygon.
2 The 0.618 method and the convex polygon method for minimum condition evaluation of straightness error are introduced, and their high-level language programs are given in this paper.
3 Graphics cutting algorithm. These rectangular cutting, and cutting convex polygon.
4 Any convex domain could be approached by convex polygon, for temperature distribution within convex domain, it could be approximated by irrational function interpolation.
5 Convex polygon problem is one of the basic problems of computational geometry, in many fields.
6 A convex domain is approached by a convex polygon, and the approximated temperature distribution within the domain can be interpolated with the temperature data at the boundaries of the domain.
7 An algorithm of filling convex polygon is provided in order to construct real-body model fast.
8 Concave polygons have to be divided into several convex polygons, and are clipped according to convex polygon clipping algorithms.
9 Concave polygons have to be divided into several convex polygons, and are convex polygon clipping algorithms.
10 Draws a single , convex polygon . Vertices 1 through N define this polygon.
11 The convex polygon is constructed by vector product in order to solve the straightness error.
12 A particular convex polygon with seven sides has exactly one right angle.
13 The algorithm makes full use of the order of vertices of the convex polygon, so that the minimum time complexity of the algorithm can be achieved.
14 This paper first studies the graphic outer and inner cut by convex polygon, then the graphic cut by arbitrary polygon. Its application of compiler program proves to be satisfactory.
15 Finally, numeral simulation shows that the star pattern identification algorithm based on the convex polygon has high robustness and the ratio of identification is above 99%.
16 The cutting object is complicacy geometry entity, which is complicacy polygon with arc , arc boundary and hole, the cutting window can be cave or convex polygon.
17 A profound approach about SCARA manipulators configuration space is made in this paper. The obstacle space of SCARA manipulator produced by convex polygon obstacle is proved to be a connected area.
18 Experiment has shown that this algorithm is robust and efficient in coincident intersection test for 3-D convex polygon.
19 An attempt has been made to compare different algorithms which are based on the methods of 0.618, standard rotation and convex polygon.
20 In real-time update algorithm of nearest neighbor query of moving objects, safe area is always an irregular convex polygon which is difficult to solve.