“polygon”造句，怎麼用polygon造句

vector polygon of position of mechanism

Joining two nonadjacent vertices of a polygon.

Algorithm for smallest quadrangle encasing box of convex polygon

Convex polygon star pattern identification algorithm for celestial guidance

Then from far to near objects paintings (Polygon), in the past because of the high priority and the coverage far polygon.

Polygon overlay is a spatial operation in which a first thematic layer containing polygons is superimposed onto another to form a new thematic layer with new polygon.

Improved ray method to judge the relation of point and polygon including simple curve

Two layer regular polygon central configurations of 2n-body problems are studied.

Each point of the polygon is added to the temporary shape on line 23, and if it's the first point in the polygon, its location is recorded as the placement for the text annotating that piece.

Triangles are popular with 3d implementations because you can define any polygon as a set of triangles.

The algorithm includes two main parts:the algorithm of polygon intersection detecting and the optimization of the collision step.

Its worth noting that whatever coordinates you choose, the texture will be warped to fit your polygon.

In every small area on the circle, elliptic, installation, such forms of polygon square, can be shot depending on improving goal level.

Next, by extracting convex polygons consecutively, the noconvex polygon is described as topological structure made of convex polygons at defferent layers.

This article tries to show, with the help of the formula of rotated axes, that centroidal axes of equilateral polygon is the centroidal axes and gives the research on its application.

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.

In the algorithm designed here, polygon-fill algorithm and "Painter Algorithm" are used to display 3-D isoline, "Windup Storage" method to balance computer processing load, "Associative Fan in" method to conflate results, and "Run Length Compression" method to save network communication time.

an eleven-sided polygon.

A polygon having seven sides.

slanted across a polygon on a diagonal line.

An algorithm for label of isograms is presented, firstly approximate polygon about isograms is found, then label on isograms or polygon according to system requirement is written out.

The circle has greater area than a regular polygon of the same perimeter.

New algorithm for determining position relation between simple polygon and point

This thesis proposes a texture reconstruction algorithm to reconstruct the corresponding textures of surfaces suitable for polygon-based representation.

If the last vertex is identical to the first vertex, it is a closed form and the polyline forms a polygon.

We have proposed an arithmetic of this kind to eliminate the vertex in a circling way, ignoring the knaggy character and the deasil or anticlockwise direction of the plane polygon.

Based on the theory of the most width of polygon must be through its certain covex vertex, this paper improves the calculating method of blanking step, so the speed of calculating blanking step is the improved, and the method assures the result is optimum.

A polygon having six sides.

A polygon with eight sides and eight angles.

a spherical polygon formed by the arcs of 3 great circles.

Based on constructing convex polygon by extremity vertices and computing cross products of polygon's edge vectors, an algorithm for automatic identifying the orientation, convexity concavity of a simply polygon is proposed.

And they are often distorted. First, a low passed filter is used to smooth the contour. And a polygon approximating method based on area error is used to approximate the contour.

A polygon whose angles are equal.

The control points of the rational spline to be constructed were computed simply by the vertices of the given polygon.

a twelve-sided polygon.

Geometry describes locations on a flat (i.e. Euclidean) plane, and can be used to determine information such as the shape and area of a polygon.

If the point is within the polygon, the line will intersect the edges of the polygon an odd number of times.