398 results about "Triangular grid" patented technology

A printed page tag encoder has an input at which to receive a tag structure template, an input at which to receive fixed data bits, an input at which to receive variable data bit records, and a tag dot generator outputting single bits depending on position in the tag defined by the tag structure template and said fixed and said variable data. The encoder additionally has a redundancy encoder for optionally encoding said fixed and / or said variable data. The redundancy encoder utilizes Reed-Solomon encoding. Tags are placed regularly on a page and ideally in a triangular grid.

The invention discloses a hole repairing method for a digital tooth grid model. The method comprises the following steps: automatically searching the boundary of the digital tooth grid model and displaying all the vertexes of the boundary; alternately selecting vertexes belonging to the hole boundary from all the vertexes as starting and stopping vertexes of the hole boundary, and constructing a closed hole boundary based on the starting and stopping vertexes; performing triangular grid filling on the closed area in the closed hole boundary by adopting a forward travelling wave propelling algorithm and generating the grid mesh surface of the closed area; and optimizing the grid mesh surface in the closed area and near the original tooth grid model boundary by adopting a least squares grid algorithm. According to the hole repairing method, the surface mesh of the tooth model hole area can be rapidly generated by directly selecting the starting and stopping vertexes on the hole boundary of the originally input digital tooth grid model, then the newly generated grid can be optimized, so that the grid on the part of the hole area can be naturally spliced with the tooth grid on the original model, and the newly generated curve is smooth and has high quality.

The invention discloses a multi-cutter optimization combination selection method for triangular grid model numerical control processing, and the method comprises the steps: reading in a triangular grid model and building topological information; enabling the model to be segmented into a plurality of feature subregions based on a patch normal vector and a patch principal curvature; carrying out thequick cutter interference inspection of the feature regions which may generate interference, and obtaining a cutter interference region; employing different cutter track generation strategies for different types of feature subregions, and estimating the lengths of tracks based on a corresponding line spacing calculation formula through cutter track length estimation models of all feature regions;determining the smallest cutter according to the maximum principal curvature of a triangular patch and a standard cutter size, and employing a genetic algorithm to optimize other cutters. The methodcan obtain a high-efficiency processing cutter combination of a complex triangular grid model more effectively and precisely.

The invention discloses a multi-beam antenna array and a multi-beam antenna. The multi-beam antenna array comprises at least one first antenna sub-array and at least one second antenna sub-array, wherein the first antenna sub-array comprises a plurality of first radiation units which are arrayed in a square grid way; and the second antenna sub-array comprises a plurality of second radiation units which are arrayed in a triangular grid way. The first antenna sub-array arrayed in the square grid way and the second antenna sub-array arrayed in the triangular grid way are mixed in the same multi-beam antenna array, so that the index of the sidelobe level of the horizontal plane of the multi-beam antenna can be effectively optimized.

A puzzle game where the objective of the game is to create a target number of HEXA and DIA formations per level using a set of primary sub-formations. The game is further intensified by the introduction of secondary sub-formations and a set of Reward Buttons that are awarded for completing different formations. The present invention uses a novel way of scoring where points are calculated based on the formations created by a player and the time remaining in the level. Therefore, if a player finishes a level faster, the player gets additional points. There is also an Infinite game mode for PDA and mobile phone users that allows play until the battery in the device runs out or the device shuts off due to a low battery that has no set levels and set scoring based on various possible formations only.

A puzzle game where the objective of the game is to create a target number of HEXA and DIA formations per level using a set of primary sub-formations. The game is further intensified by the introduction of secondary sub-formations and a set of Reward Buttons that are awarded for completing different formations. The present invention uses a novel way of scoring where points are calculated based on the formations created by a player and the time remaining in the level. Therefore, if a player finishes a level faster, the player gets additional points. There is also an Infinite game mode for PDA and mobile phone users that allows play until the battery in the device runs out or the device shuts off due to a low battery that has no set levels and set scoring based on various possible formations only.

The invention provides a bone CT sequence image oriented grid model adaptive reconstruction method. The method includes following steps: extracting two-dimensional profile data of bones in each layer of a CT image in sequence; converting a formed multi-layer two-dimensional profile data set to three-dimensional point clouds with normal vectors; constructing an implicit surface of a bone model; performing adaptive primitive sampling on the bone implicit surface; and performing triangularization on an adaptive primitive set to form a bone grid model. According to the method, the generation of a lot of redundant triangular grids and narrow and long triangular grids can be prevented in the bone model, the high-quality triangular grid model can be adaptively reconstructed according to the curvature of the bone surface, reasonable transition between the triangular grids of different dimensions is realized, the smoothness effect of the grids is good, and important application values are achieved in the field of digital osteology.

The invention discloses laser-fuze near-field return wave power calculation based on wave beam decomposition and partial irradiation. The laser-fuze near-field return wave power calculation comprises the following steps: firstly, establishing a fuze coordinate system and a laser-fuze launching site model, adopting 3D Max to carry out geometric modeling, then, adopting a triangular grid mode to carry out surface grid division on a complex target surface, and extracting vertex numbers and vertex coordinate information of triangle face-units of a geometric model; carrying out wave beam decomposition on a laser wave beam at a cross section of the laser wave beam, and dividing grids at equal intervals on the cross section of the laser wave beam, approximately considering that strength on each grid is uniform when the grids are small enough, approximating the strength of the whole grid by utilizing strength of the center point of each grid, and adopting a transmission distance to determine longitudinal attenuation in a longitudinal direction; decomposing an original laser wave beam into a plurality of small wave beams, calculating return wave power of each small wave beam, and finally, superposing, thereby obtaining overall return wave power of fuze. The laser-fuze near-field return wave power calculation has the beneficial effects that calculation for a target near-field return wave signal is high in precision, and reaction speed is high.