Random good picture Not show

61. The plane figure formed by connecting three points not in a straight line by straight line segments; a three-sided polygon.

62. Each edge of the polygon fluid separating screen is axially provide with an outer filtering screen.

63. A laser scanning path generating scheme has been proposed and the algorithm of polygon decomposition by identifying all narrow characters been given.

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

65. Select the polygon where you want to make the holes for the fan and click a few times on the tessellate button.

66. At the same time convert the angle of the polygon at that vertex into a straight angle.

67. All of these provide the key technique for the realization of line symbol. Since Polygon fill algorithm is very important for the realization of area symbol, there are lots of analysis on it.

68. This paper introduces optimizing the design of the frame structure in the way of the regular polygon, so as to save the stuff and make the design of the frame structure more economical.

69. Any convex domain could be approached by convex polygon, for temperature distribution within convex domain, it could be approximated by irrational function interpolation.

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

71. The racket bar has a cross section of regular polygon, so as to improve beat precision and durability and reduce impact through exerting elastic force only in one direction without distortion.

72. 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.

73. In this paper, the electric-field intensity distributions on the axes of charged regular polygon frame and surface are introduced, and the results in critical conditions are discussed.

74. Click the left records the target polygon, right - record fixed - point polygon, double - click the right - closed polygon.

75. Convex polygon problem is one of the basic problems of computational geometry, in many fields.

76. The major polygon epithelioid cells and rhabdomyoid cells with cytoplasm crimson staining were the main component and hypopigment in 12 cases from pathomorphism.

77. Described an algorithm for constructing trigonometric spline curve, which was tangent to the given polygon.

78. It is the basic function in the digital cartographic, electronic cartographic and GIS, the polygon be filled with point symbol.

79. This paper introduces the principle and the method of using the vector operation to recognize concave or convex, vertices of polygon and the recognition speed is very high.

80. In this paper, a method about contour extraction of regular targets in images is proposed, which is based on an improved rectangle fitting method and a polygon fitting method.

81. Add the unit UPhysics 2 DPolygonTool , the segmentation of an arbitrary polygon ( triangulation ).

82. This method can insure the horizontal scanning start point in the same position and eliminate the angle division error of the polygon mirror.

83. A lot of experiments for open loop control and closed loop control have been made according to the polygon voltage vector control. The experiment result shows that the new scheme is feasible.

83. Sentencedict.com try its best to gather and create good sentences.

84. Existing polygon clipping algorithms are all offered for a rectangular window or a convex polygonal window.

85. This paper presents a new polygon filling algorithm based on vertex storage types.

86. Moreover, a method of transforming polygon is proposed to recurrently optimize power supply network, and it results in a cost lowest network.

87. Recursion algorithm is used in programming, and repeat the above steps for each new polygon until termination condition is met.

88. 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.

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

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