polygon造句
1. Figure 7.4 Closure error in polygon digitizing.
2. The polygon definitions are written to the file whose unit number is 11.
3. The error can spread over the polygon by altering the positions of the boundary points appropriately.
4. Positive form can be introduced into any polygon or polyhedron by regarding it as a closed skin subjected to internal expansion.
5. Experiment will reveal that any regular polygon needs similar adjustment to transform a geometric shape into a sensory image.
6. The corners of any regular polygon rest on the circumference of a circumscribing circle.
7. What is the perimeter of this polygon?
8. On the polygon, ellipse and circle can be filled.
9. Triangulate partitioning polygon is geometric primitives of computational geometric.
10. This paper gives a new algorithem for polygon clipping.
11. The frequency polygon is simpler than its histogram counterpart.
12. Draw the corresponding frequency polygon over the histogram.
13. Draw the cumulative frequency polygon for the distribution.
14. Now selects the front polygon and inset it.
15. Draws a single, convex polygon.
16. A polygon with ten sides is a decagon.
17. Boundaries of the polygon may extend to infinity.
18. Finally, the effective general polygon clipping algorithm is given.
19. How many diagonals does this seven-sided polygon have?
20. Draw the corresponding cumulative frequency polygon.
21. Two layer regular polygon central configurations of 2N-body problems are studied.
22. They are completely regular solids: each has all of its faces repeating a regular polygon, triangle, square or pentagon.
23. They could then be converted back into vector form as polygon data and superimposed on the deterministic results.
24. Write a formula that shows the relationship between the amount of degrees in a polygon and the number of sides it has.
25. 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.
26. The key parameters such as feed pitch and strip width can be calculated only in the range box of the original polygon.
27. This paper extends the concept of monotone chain in computational geometry. It presents a new polygon scanning fill algorithm , polygon filling algorithm based on monotony chain.
28. Object positioning is based on local normal of a polygon or vertex in destination object and world up axis.
29. This partition is called the bisector skeleton of the polygon.
30. Based on the Curvilinear Integral and its sorted edge table, a new polygon fill algorithm is developed in the article.
12345