543 results about "Triacontagon" patented technology

A system and method for determining graphical object visibility by utilizing ancillary geometry. When comparing visibility cones with bounding hulls of scene graph hierarchy leaf nodes, ancillary geometry may be used in place of the bounding hulls and the leaf node's actual geometry. The ancillary geometry may be created through a manual process, or by an automated decimation process. The ancillary geometry may be a simplistic analytic surface (e.g., a sphere or a cylinder), a NURB surface, a collection of polygons, or a combination of surfaces and polygons.

A method and system for computer aided design (CAD) is disclosed for designing geometric objects, wherein interpolation and/or blending between such objects is performed while deformation data is being input. Thus, a designer obtains immediate feedback to input modifications without separately entering a command(s) for performing such deformations. A novel N-sided surface generation technique is also disclosed herein to efficiently and accurately convert surfaces of high polynomial degree into a collection of lower degree surfaces. E.g., the N-sided surface generation technique disclosed herein subdivides parameter space objects (e.g., polygons) of seven or more sides into a collection of subpolygons, wherein each subpolygon has a reduced number of sides. More particularly, each subpolygon has 3 or 4 sides. The present disclosure is particularly useful for designing the shape of surfaces. Thus, the present disclosure is applicable to various design domains such as the design of, e.g., bottles, vehicles, and watercraft. Additionally, the present disclosure provides for efficient animation via repeatedly modifying surfaces of an animated object such as a representation of a face.

The embodiment of the invention discloses an integrated circuit layout field domain identification and grid subdivision processing method and device. The method comprises the following steps: vertically projecting a plurality of polygons of each layer of integrated circuit layout to the same layer to form a Delaunay triangular grid; combining the polygon information and the layer information of the edges of the polygons which are superposed after projection; aligning the grids to the edges of each polygon, calculating the intersection points of the edges of each polygon, adding the intersection points into polygon vertexes and grid nodes to form a first triangular grid, forming a set by the edges of the polygons by an edge exchange method, taking out the edges of the polygons, exchanging the edges of the polygons, and if the set is a null set, ending the exchange; superposing the layer information of the edges of the polygons into all triangles in the polygons; identifying and collecting triangles and polygonal edges contained in each parallel flat plate field domain according to the layer information of the triangles and polygonal edges; and carrying out grid subdivision processing on triangles in each parallel flat plate field domain. According to the invention, the accuracy and high efficiency of the field domain identification and grid subdivision processing method can be ensured.

A metallic hollow columnar member with a polygonal cross-section having at least five vertices and sides extending between the vertices, is disclosed. The polygonal cross-section is divided by two vertices (A, B) with small inside angles into two perimeter segments with a perimeter comprising one or more sides, and at least one of the two perimeter segments contains at least four sides. The respective inside angles of at least three vertices (V(i)) included in the perimeter segment which includes the at least four sides are equal to or less than 180°, the distance (SS(i)) between each of the at least three vertices (V(i)) and a straight line (L) connecting the two vertices (A, B) is shorter than ½ of the distance between the two vertices (A, B), and the inside angle of the vertex (C) with the smallest inside angle among the at least three vertices (V(i)) is larger than the inside angles of the two vertices (A, B). Vertices (VI) are present on the perimeter segment including the at least four sides, respectively between the vertex (C) with the smallest inside angle among the at least three vertices (V(i)) and one (A) of the two vertices (A, B), and between the vertex (C) with the smallest inside angle and the other (B) of the two vertices (A, B), said vertices (VI) having inside angles larger than the inside angle of the vertex (C) with the smallest inside angle.

The invention discloses a wheel polygon identification method based on the wheel-rail vertical force and a device thereof. The identification method comprises the following steps: collecting the wheel-rail vertical force signal by the shear stress method; and analyzing the collected wheel-rail vertical force signal Carry out the EEMD decomposition of the ensemble empirical mode to obtain the aggregated intrinsic mode function IMF component; calculate the marginal spectrum of the intrinsic mode function IMF containing the wheel polygonal disease characteristic information; according to the obtained marginal spectrum of the intrinsic mode function IMF, obtain The damage characteristic frequency f is used to identify whether the wheel has polygons and the type of polygons according to the preset judgment criteria. Its advantages are: it can carry out real-time monitoring and damage evaluation on the vehicles passing through the monitoring section, and it has the characteristics of fast and accurate; The marginal spectrum of the wheel-rail vertical force damage characteristic frequency after polygonal damage of the wheel is obtained.

The embodiment of the invention discloses a multi-layer integrated circuit layout polygon alignment and simplification processing method and device. The method comprises the following steps of projecting a plurality of polygons of a multilayer integrated circuit layout to a same layer, and forming a Delaunay triangular mesh according to a Delaunay triangulation algorithm; aligning the Delaunay triangular mesh to each edge of each polygon, calculating the intersection points of the edges of each polygon, and adding the intersection points into the polygon vertexes and the Delaunay triangular mesh nodes to form a first triangular mesh; on the basis, forming the inner and outer auxiliary polygons for clamping the polygons inside and outside each polygon, and controlling the distances betweenthe inner and outer auxiliary polygons and the polygons through the distance thresholds; and aligning and simplifying the edges of each layer of polygons falling between the inner and outer auxiliarypolygons. According to the present invention, the fragmentation problem after the multilayer polygons form the parallel flat plate field domain can be reduced, the unnecessary dense grids are reduced,the analysis and solving time and the required memory of the multilayer integrated circuit are shortened, the gaps among the polygons can be reserved, and the integrated circuit layout shape is basically not changed.

A three dimensional (3D) poly-phase transformer includes a plurality of transformer ribs mechanically and magnetically coupled such that each transformer rib forms a leg of a polygon. A plurality of the polygons forms a 3D polyhedron structure. At least two base planes of the 3D poly-phase transformer including a polygon have a plurality of base ribs. At least four side ribs of the 3D poly-phase transformer are disposed between the base planes. The 3D poly-phase transformer includes a plurality of primary and secondary transformer windings. Another 3D poly-phase transformer includes at least two base planes having a closed curve. Each closed curve includes a plurality of curved base ribs, and at least four side ribs of the 3D poly-phase transformer disposed between the base planes. Methods of manufacturing three dimensional (3D) poly-phase transformers are also described.

The invention discloses a method for repairing defects and holes of a three-dimensional mesh model based on characteristic lines, which comprises the following steps: 1) detecting characteristic lines: describing the corresponding principal direction curvature fitting extreme value on the mathematical definition of the characteristic lines on the surface of the three-dimensional mesh model which can represent the prominent geometrical characteristics; 2) matching of characteristic lines: selecting an optimal matching pair through a matching probability measurement standard for the characteristic lines detected in the step 1); 3) triangulation and thinning adjustment: after matching and bridging the characteristic lines, the original hole is partially changed into a plurality of polygonal sub-holes, and the basic surface is constructed; then Delaunay triangulation and edge scoring function are calculated for each polygon sub-hole, and an influence factor is assigned to each edge of thepolygon sub-hole to realize the anisotropic refinement of the mesh and the repair of the damaged area of the hole. The damaged area of the repaired holes can keep the same density with the surroundingtriangular mesh, and can be naturally connected with each other.

The invention relates to a positioning control method for the closed region of a vehicle-mounted GPS (Global Positioning System), wherein the closed region is a polygon. The positioning control method provided by the invention comprises the following steps: (1) the convex hulls of the polygon are established; (2) the circumscribed rectangle with the minimum area of the polygon is established; (3) the positioning judgment courses are as follows: 3.1) judging whether the current point is in the circumscribed rectangle with the minimum area or not; if the point is outside the circumscribed rectangle with the minimum area, judging that the current point is not in the closed region; if the point is in the circumscribed rectangle with the minimum area, carrying out the next step; and 3.2) judging whether the point is in the simple polygon or not. The positioning control method provided by the invention has the advantages that the computation is simplified; the speed is high; and the occupation of the closed region of the vehicle-mounted GPS on CPU (Central Processing Unit) resources is greatly reduced.

The embodiment of the invention discloses a polygon adaptive simplification processing method and device for an integrated circuit layout. The method comprises the following steps of obtaining a plurality of polygons of the integrated circuit layout containing a plurality of vertexes, and forming a Delaunay triangular grid taking the vertexes of the polygons as the grid nodes; aligning the Delaunay triangular grid to each edge of the plurality of polygons according to an edge exchange method to form a first triangular grid; identifying all triangles in the plurality of polygons in the first triangular grid according to an extrapolation method, wherein the extrapolation method forms all polygons into a set; taking out the polygons from the set one by one, identifying the triangles, repeating the operation until the set is an empty set, and then ending the identification; and judging whether the edges of the plurality of polygons in the first triangular grid meet a preset rule, and performing the adaptive simplification processing on the plurality of polygons according to the quality of each triangle when the preset rule is met. According to the invention, the accuracy, completenessand high efficiency of the polygon adaptive simplification processing method for the integrated circuit layout can be ensured.

The invention relates to a jib arm structure of a lorry-mounted crane. The jib arm is formed by bending a steel plate into a structure of which the cross section is a polygon in one step by means of a bending machine, wherein two short sides corresponding to an opening of the polygon are connected with each other by welding, so that long sides and the short sides of the polygon are connected into a whole. By using the jib arm having a one-welding seam structure, the invention has the advantages of less possible torsional deformation and more reasonable stressed state. The geometric accuracy of the jib arm can be effectively controlled in the bending process, welding deformation has minimal influence on the structural dimension precision of the jib arm, the product quality control cost is lowered, the product quality is ensured, the production efficiency is improved, and the labor intensity of workers is reduced. Besides, the structural strength of the jib arm is obviously improved.

The invention discloses an air defense missile space killing area model construction and shooting data element calculation method based on a small amount of actual data. The method mainly comprises the steps of (1) acquiring air-defense missile data 2) based on the air defense missile data, establishing a space killing area model; and 3) resolving the space killing area model to obtain shooting data. According to the method, a killing area model is constructed by adopting a polynomial fitting method, a linear fitting method, a curved-edge polygon mapping matrix algorithm, a planar polygon mapping matrix algorithm and a spatial polygon mapping matrix algorithm according to the analytic geometry mathematical model of the killing area and a small amount of public actual data, and the defect of blindness and low efficiency of traditional spatial killing area construction is overcome.

The invention discloses a point cloud-oriented lightweight polygon surface reconstruction method. With the method adopted, the problem that it is difficult to obtain the real expressions of real worldobjects from incomplete point clouds with noise points can be solved. The method mainly comprises the following steps that: S1, a scanning device is adopted to acquire an object surface space point cloud P, so that an original point cloud can be obtained; S2, candidate planes are generated; and a plane is selected. According to the method, the optimal subset of the candidate planes is selected through using a binary linear programming formula, and finally, a water-tight polygonal surface model with a manifold is reconstructed.

The invention discloses a method for searching a shortest path of an inevitable node. The method comprises processing steps that S1, a Thiessen polygon is constructed; S2, if a starting point inevitable node and a terminal point inevitable node are not the same inevitable node, S3 is carried out; S3, adjacent Thiessen polygons are queried and combined to form a first combined polygon by taking theThiessen polygons where the starting point inevitable node is located as the starting point; S4, adjacent unprocessed Thiessen polygons are queried and combined to form a second combined polygon by taking the first combined polygon as a reference; S5, the isolated Thiessen polygons are combined into a certain combined polygon with adjacent common edges; S6, edges, which are not in the same combined polygon, of two vertexes in the Denaulay triangle are deleted; S7, if the condition that a node degree is greater than or equal to 3 does not exist in the remaining side lines in the combined polygon exists, S8 processing is carried out; and S8, side lines in each combined polygon are connected end to end, and the short connecting line is taken as a result. The method is advantaged in that processing difficulty, cost and time can be effectively reduced, and search efficiency is improved.

The invention provides a two-dimensional rapid iteration method for electromagnetic response of a three-dimensional large-scale integrated circuit. The two-dimensional rapid iteration method comprises the following steps: 1, dividing each layer of integrated circuit layout with a complex shape into polygons with simple shapes; 2, taking the influence of other layers as an additional source, and calculating the electromagnetic field and surface current distribution of each layer of the integrated circuit layout through a two-dimensional finite element method; 3, calculating the influence of the non-uniformly distributed surface current on the simple-shaped polygon on the field points through two-dimensional Gaussian integral based on a vector Green function of the influence of a point current source on the field points, and further calculating the influence of the non-uniformly distributed surface current on the complex-shaped integrated circuit layout on the electromagnetic field distribution of all other layers; and 4, judging whether the change quantity of the electromagnetic field distribution of all layers is smaller than a preset error threshold value or not, if yes, ending, and if not, turning to the step 2. The invention further provides a device of the method, and the electromagnetic response on the three-dimensional integrated circuit layout can be rapidly calculated through two-dimensional iteration.

A drawing apparatus is for drawing a three-dimensional model including a plurality of nodes present in a three-dimensional space, by using a plurality of viewpoints. The drawing apparatus includes a memory configured to store drawing information including a correspondence relationship between the plurality of nodes and the plurality of viewpoints, and drawing parameters relevant to the plurality of viewpoints; and a CPU configured to transform the three-dimensional model into an image, by a plurality of polygons constituting the three-dimensional model, by using the drawing information. The CPU changes the drawing information in response to a position or a state of a predetermined one or a plurality of the nodes satisfying a predetermined condition, and calculates drawing positions of vertices of the plurality of polygons, by using the viewpoints corresponding to the nodes to which the vertices belong, based on the changed drawing information.

A method of decomposing a target pattern having features to be imaged on a substrate so as to allow said features to be imaged in a multi-exposure process. The method includes the steps of: (a) segmenting a plurality of the features into a plurality of polygons; (b) determining the image log slope (ILS) value for each of the plurality of polygons; (c) determining the polygon having the minimum ILS value, and defining a mask containing the polygon; (d) convolving the mask defmed in step (c) with an eigen function of a transmission cross coefficient so as to generate an interference map, where the transmission cross coefficient defines the illumination system to be utilized to image the target pattern; and (e) assigning a phase to the polygon based on the value of the interference map at a location corresponding to the polygon, where the phase defines which exposure in said multi-exposure process the polygon is assigned.