662 results about "Triacontagon" patented technology

Techniques are provided comprising receiving map data and determining a first polygon representing a first traversable surface and a second polygon representing a second traversable surface. The first polygon may include a first portion that overlaps with a second portion of the second polygon. The techniques may determine, based at least in part on elevation information associated with the first traversable surface and the second traversable surface, respective elevation layers associated with the first polygon and the second polygon. It may be determined whether to merge the first polygon and the second polygon based at least in part on whether the first polygon is associated with a same elevation layer as the second polygon. Based at least in part on determining whether to merge the first and second polygons, an updated map may be determined.

The invention discloses a new energy station rendering method based on a virtual micro-polygon geometry technology, and relates to the technical field of new energy station three-dimensional rendering, and the method comprises the following steps: combining new energy station model triangular patches into a micro-polygon data set, carrying out the model clustering through a graph data structure, and obtaining a micro-polygon data set; forming virtual geometric grid bodies with different granularity refining grades; and splicing the micro-polygon data sets into polygon groups, carrying out surface reduction operation by taking the polygon groups as units, and locking boundaries among the groups. According to the method, the triangular patches of the new energy station model are combined into the micro-polygon data set, rendering is performed at the pixel-level precision, the detail performance of the new energy station model can be remarkably improved, and compared with a traditional granularity refining technology, the detail level can be dynamically adjusted at different sight distances and visual angles, high-precision visualization of the model is ensured, and the method is suitable for large-scale popularization and application. Technicians can be helped to understand and evaluate the structure and layout of the station more visually.

The invention discloses a printed circuit board copper coating method based on large-scale polygon Boolean operation solution, and the method comprises the steps: data preprocessing: carrying out a series of preprocessing operations, including geometric element screening, polygon screening, line segment merging and arc splitting, on input polygon data, so as to optimize a data structure and reduce the complexity of subsequent calculation; and operation sequence optimization: performing difference set operation on the main polygon and each polygon one by one by splitting a polygon union set result so as to optimize the operation sequence and reduce the increase of the number of edges in an intermediate result, thereby reducing the calculation complexity. The polygon Boolean operation comprises intersection operation, namely, screening and calculation of intersection points are accelerated through grid division and a KD tree, intersection between a straight line segment and a curve is included, the intersection points are determined through a geometric method, and in-out attributes of the intersection points are considered. And then contour processing is carried out, that is, a polygon contour after Boolean operation is generated by utilizing an edge winding algorithm and access point attributes, and whether a union set or an intersection set is solved.

The invention relates to the technical field of mark point identification and positioning, in particular to a polygon mark point rapid identification and positioning method and system and a storage medium. Then, the gradient direction information and the coordinate information of the reserved strong edge are used for rapidly estimating the rotation angle and the center of the polygon mark point to be detected, the method is small in calculation amount and easy to operate, and rough pose information of the polygon mark point to be detected can be rapidly obtained; the estimated angle is further corrected in a small range in a rotary projection mode, the deviation between an estimated value and a real value is reduced, and a more accurate initial value is provided for subsequent registration; finally, the corrected coarse positioning result is used as an initial value for registration, the convergence speed can be increased, the number of iterations can be reduced, meanwhile, the probability that iteration falls into a local extreme value can be reduced, the operation speed is increased, and the accuracy rate is increased.

The invention provides a safety coefficient prediction method based on slope three-dimensional finite element analysis and application, and relates to the field of hydraulic geotechnical engineering. Comprising the following steps: inputting a finite element grid, and calculating a geometric topological relation of the three-dimensional finite element grid; the method comprises the following steps: inputting position information and mechanical parameters of a bottom sliding surface and a side sliding surface of a possible sliding block, calculating to obtain a description equation of the possible sliding block, performing cutting calculation by utilizing a sliding surface equation and geometry of a finite element grid to obtain polygons of a boundary surface of the sliding block, decomposing each polygon into triangular grids, and analyzing a stress result based on a slope finite element to obtain a stress result of the boundary surface of the possible sliding block. Calculating stress values of triangular mesh nodes of the boundary surface through line interpolation; integration is carried out on the sliding force and the anti-sliding force of the boundary surface, and the safety coefficient of the possible sliding block body is calculated; according to the method, efficient intersection of the sliding surface and the finite element grid is achieved, geometric processing efficiency is improved, calculation efficiency and calculation accuracy are improved, and the method is suitable for three-dimensional irregular sliding block analysis in the fields of water conservancy, mines and the like.

Techniques for dividing a geographical area into districts are described herein. Geospatial vector data, barrier geospatial vector data, road infrastructure data, and historical delivery demand data for a geographical area may be obtained. A plurality of clusters from a stratified sampling of data points for the delivery demand data and barrier penalties from a barrier-aware road graph are generated. A first set of polygons for the plurality of clusters may be generated using a concave hull algorithm. A second set of polygons may be generated using a barrier constrained network Voronoi algorithm that uses the barrier-aware road graph and the first set of polygons as seeds. The second set of polygons may be modified using a bounded Voronoi algorithm that uses a raster cost allocation based on barrier penalties. Coordinates for each polygon of the modified second set of polygons are determined that divide the geographical area.

In a method, a bitstream of a mesh that includes a plurality of vertices is received. When the mesh is symmetric with respect to a symmetry plane, a first group of vertices of the mesh that is positioned at a first side of the symmetry plane is reconstructed. A second group of vertices of the mesh that is positioned at a second side of the symmetry plane is reconstructed by reflecting the reconstructed first group of vertices with respect to the symmetry plane.

The invention discloses a polygonal and quadrilateral mesh automatic subdivision method based on deep reinforcement learning, relates to the field of computational geometry and mesh generation, and constructs an automatic subdivision framework fusing geometric priori knowledge and a data driving strategy. According to the method, nine basic topology filling templates covering triangles to hexagons are predefined as discrete action spaces, and continuous geometric segmentation is converted into a sequence decision problem; learning a mapping relation between the polygon state characteristics and the optimal template selection strategy by using a deep Q network, and balancing exploration and utilization through a dynamic epsilon-greedy mechanism; and in combination with a vertex number priority scheduling strategy and a multi-dimensional quality award function, guiding an intelligent agent to adaptively generate a high-quality quadrilateral grid. According to the method, full-automatic and high-robustness subdivision of the complex polygon area is achieved, the grid orthogonality and the length-width ratio quality are remarkably improved, manual intervention is avoided, and the method is suitable for engineering scenes such as finite element analysis.

Disclosed are lattice materials including a truss structure obtained by arranging struts to form at least two triangles on each side of a polygon (i.e., a triangle, a quadrilateral, or a hexagon), which are used in many engineering fields, especially in materials engineering. The elastic modulus values per unit weight of many of the lattice materials produced from the truss structure are higher than those of the most existing cellular solids with stochastic cell distributions and many existing lattice materials. Using the truss structure disclosed herein, it is possible to produce two-dimensional (planar) lattice materials as well as spherical or tubular lattice structures in the form of a first cylindrical tube or a second cylindrical tube.

A high-sensitivity electric field sensing structure, comprising a regular polygonal metal microstrip patch internally tangent to a circle, wherein the regular polygon has at least eight sides, and the regular polygon has an even number of sides. A Koch curve is used to carry out second-order or higher-order fractal processing on the metal microstrip patch; complementary slotting processing of 0.4-0.8 times is carried out in the metal microstrip patch subjected to fractal processing; a complementary slot and a front feeder line form a gradient network structure; and the outer edge of the metal microstrip patch is further provided with asymmetric branches. The use of the fractal technology, the complementary slotting technology, the asymptotic technology and the asymmetric loading technology well expands the bandwidth, most or even full coverage of an electric field frequency band can be basically achieved with a relatively small size, the structure is simple, the use of the complementary slotting technology reduces the use amount of copper sheets and the use costs, and real acquisition of high-voltage electric field signals can be achieved.

The invention discloses an archive resource multi-dimensional integration analysis method, relates to the technical field of resource classification and integration, solves the problem of large index process difference caused by feature difference of different archive resources, and further forms a polygon to be integrated by constructing a verification polygon and determining feature nodes based on feature data columns. Compared with a traditional numerical variance processing mode, the innovative geometric model construction mode can achieve integration and classification of archive resources more visually and rapidly; according to the expression of the polygon in the preset storage area, the archive resources with similar characteristics can be efficiently classified into one class, the classification efficiency is greatly improved, and the requirement for rapid classification in large-scale archive resource management is met.

The invention relates to a geometric optimization method for copper sheet layout, computer equipment, a storage medium and a product. The geometric optimization method is used for optimizing an acute angle structure of a copper sheet in the design and manufacturing process of a printed circuit board, and comprises the following steps: providing a polygonal copper sheet area, and obtaining vertex coordinate data of the polygon; constructing a first geometric model corresponding to the polygon according to the vertex coordinate data, and traversing vertexes of the polygon in the first geometric model; defining two adjacent vertexes of the vertexes as a preorder vertex and a postorder vertex respectively, and judging whether an included angle formed by connecting lines among the preorder vertex, the vertexes and the postorder vertex is an acute angle or not; when the included angle is an acute angle, calculating a common tangent circle corresponding to the included angle, and constructing a second geometric model corresponding to the common tangent circle; and based on the second geometric model, carrying out smoothing processing on the area with the included angle being the acute angle to obtain an optimized copper sheet layout.

The invention discloses an axial segmentation dislocation type polygonal permanent magnet synchronous linear motor, belongs to the field of permanent magnet motors, and aims at solving the problems that an existing polygonal permanent magnet synchronous linear motor is large in end force and high in thrust fluctuation. The device comprises six primary modules which are arranged on the outer side in a polygonal layout; the secondary module is located in the center of the polygonal layout and is of a cuboid frame structure with two open ends, and the air gap distances between the secondary module and all the primary modules are equal; the six primary modules comprise two mother modules and four sub-modules, and the length, the pole number and the slot number of the mother modules are twice of those of the sub-modules; each side of the secondary module is provided with one mother module or two sub-modules, and the primary module structures of the two opposite sides are symmetrical; the two sub-modules located on the same side edge are axially arranged in a staggered mode with the central axis of the mother module as the reference, and winding reconstruction arrangement is carried out; the armature windings of each phase of any primary module are connected in series or in parallel to form a phase winding, and the same phase windings of the six primary modules are connected in series.

A polygon mesh includes a plurality of vertices that are connected into faces, a first face in the faces includes at least a first vertex, a first previous vertex of the first vertex, a first next vertex of the first vertex in a first list of vertices that are incident to the first face. A method of mesh processing includes generating a first incident face set associated with the first vertex, the first incident face set includes a first set of faces that includes the first vertex as an incident vertex, the first incident face set including the first face. Further, the method includes configuring an array according to the first incident face set associated with the first vertex, and determining an iteration order for processing the first set of faces based on the array.

The invention provides a method and a device for determining a navigation channel area, a medium and a program product. The method comprises the following steps: S1, acquiring position coordinates of navigation mark points contained in each water channel; s2, for each water channel, determining a radius parameter alpha of a corresponding alpha polygon according to the position coordinates of a group of navigation mark points corresponding to the water channel; s3, for each water channel, obtaining an alpha polygon corresponding to the navigation mark point of the water channel; s4, obtaining a nearest point pair of the navigation mark points between every two alpha polygons, and determining the alpha polygons of which the distance between the nearest point pairs is smaller than a preset distance; s5, for any two alpha polygons of which the distance between the nearest point pairs is smaller than a preset distance, determining a second polygon connected with the alpha polygons; and S6, combining all the alpha polygons and the second polygons to obtain a channel region. By means of the technical scheme, the navigation mark point information is used, and the navigation channel area can be determined in time when the navigation channel area changes.

The invention discloses a method and system for generating a variable non-regular polygon spiral inductor, and belongs to the field of integrated circuit radio frequency inductor layout drawing. The generation method comprises the following steps: setting parameter values of the variable non-regular polygon spiral inductor structure; in one circle of the variable non-regular polygon spiral inductor structure, calculating the coordinates of each vertex according to the parameter values; calculating the coil width of each circle and the inductance inner diameter of each circle of the variable non-regular polygon spiral inductance structure, and calculating all vertex coordinates of the whole variable non-regular polygon spiral inductance structure based on the vertex coordinates of one circle of the variable non-regular polygon spiral inductance structure; and drawing the variable non-regular polygonal spiral inductor structure according to all the obtained vertex coordinates. The shape of the spiral inductor can be easily changed by adjusting the expansion and contraction rate of the spiral inductor, so that the spiral inductor can adapt to any rectangular area, the utilization rate of the layout area can be fully utilized, and great convenience is brought to layout work.

A transverse obstacle avoidance planning method based on expansion coefficient dual transformation comprises the following steps that S1, a vehicle polygon convex set and an obstacle polygon convex set are constructed based on surrounding obstacle polygon envelope; s2, combining the motion model of the vehicle and the polygonal convex set constraint of the obstacle to construct an optimal control problem; and S3, solving an optimal state sequence and a control sequence according to the optimal control problem in the step S2, and calculating a real-time path under the Cartesian coordinate system. According to the invention, through dual transformation constraint of the collision coefficient, a constraint expression form capable of being used for accurate obstacle avoidance is effectively provided, and an optimal control problem is established to solve an optimal solution.

The invention discloses a chip layout pattern topology representation and hot spot detection method. The method comprises the following steps: converting layout data into binary image data and storing the binary image data; converting polygons in the layout data into geometric sequence data and storing the geometric sequence data; storing polygon topological relation data in the layout data; constructing a hotspot detection model based on comparative learning, constructing a layout training set and a verification set according to the stored data, inputting the hotspot detection model and performing model training; and respectively calculating the hot-spot geometric sequence representation and the non-hot-spot geometric sequence representation of the test layout, inputting the hot-spot geometric sequence representation and the non-hot-spot geometric sequence representation into the trained hot-spot detection model for testing to obtain probability values of the hot-spot geometric sequence representation and the non-hot-spot geometric sequence representation, and judging whether the current test layout is a hot spot or not. According to the method, global topological representation information of the layout is introduced through serialized representation, and comparison learning is combined, so that the problem that a single decision boundary is constructed on an unbalanced data set in traditional supervised learning is solved.

Techniques for generating a layout for computing equipment in a data center are disclosed. The system represents a physical environment as a layout polygon and obstacles within the physical environment as obstacle polygons. The system represents groupings of racks as pod polygons. The system executes a positioning algorithm to place pod polygons in the layout polygon. The initial layout is optimized according to layout criteria. The system determines if any of the pod polygons in the initial layout collide with an obstacle polygon. The system attempts to resolve the collision by moving the colliding pod polygons or removing racks from a pod polygon. The system generates a basket tray path that minimizes the length of the basket tray path while avoiding obstacles in the path.

The invention discloses a front-end-based three-dimensional model section cutting plane geometric analysis method and device, and the method comprises the steps: generating a plurality of collision surfaces based on a front-end three-dimensional model; generating a plurality of line segment groups based on a plurality of line segments obtained by collision between the three-dimensional model and the target collision surface; generating a plurality of polygons based on the plurality of line segment groups; determining attribute information of the polygons; and determining the geometric metric of the target geometric region based on the attribute information of the target polygon meeting the target condition in the plurality of polygons. According to the method, a plurality of polygons and corresponding attribute information are obtained by utilizing a plurality of line segments obtained by collision between a target collision surface and a three-dimensional model, geometric measurement of a target geometric area is determined by combining the attribute information of the polygons, and digital analysis of any section cutting plane of the three-dimensional model at the front end is realized. And the type and geometric measurement of the target geometric region are accurately identified, so that the geometric analysis of the section cutting plane of the front-end three-dimensional model is effectively realized.

The invention discloses a chip layout image generation method based on a boundary tracking scanning line algorithm. A sub-graph-polygon data structure is designed, a maximum matrix of adjacent polygons of a sub-graph is established, the boundary scanning line algorithm is improved through the method, a complete chip layout is rapidly cut into a sub-graph, and a corresponding binary image is generated. According to the algorithm, a sub-graph circumscribed frame-polygon circumscribed frame data structure is designed, and polygons which are likely to intersect with the sub-graphs are quickly positioned. The data are stored to construct the maximum bounding box of all polygons contained in the current sub-graph, so that the algorithm does not need to calculate the intersection points of the polygons and the sub-graphs, and the time consumption for calculating the intersection points by the algorithm is reduced; in addition, a boundary tracking mode is designed, a scanning line algorithm is improved, intersection points of scanning lines and polygon boundaries do not need to be calculated when a certain line is scanned by storing all points in the boundaries, and algorithm complexity is further reduced.

The invention discloses a near-field dynamics modeling method and system based on rock heterogeneity, and the method comprises the following steps: obtaining a target rock sample, dividing the target rock sample according to a voronoi Thiessen polygon, and obtaining a plurality of voronoi Thiessen polygon regions; performing material point discrete processing on each voroni Thiessen polygon region to obtain a plurality of corresponding discrete material points; generating a corresponding random joint line segment from each discrete substance point through a Monte-Carlo method, and counting the number of different bonds penetrated by the currently generated random joint line segment; sequentially judging whether the number of different keys penetrated by the generated random joint line segment meets a preset number requirement or not; if yes, the current joint line segment is reserved and counted until the statistical number reaches a set value, and the heterogeneous rock near-field kinetic model containing the random joint line segment is obtained. The invention aims to accurately reflect the actual mechanical property and deformation condition in the rock.

The utility model discloses a geometric figure motion trail display device, which relates to the technical field of math teaching aids and comprises a vertical plate, a transverse plate is fixedly mounted on the lower side of the vertical plate, a first supporting column and a second supporting column are fixedly mounted on two sides of the transverse plate, notches are arranged on the upper sides of the first supporting column and the second supporting column, and racks and clamping grooves are placed in the notches. The clamping groove is located on the upper side of the rack, the interior of the clamping groove is of a hollow structure, a sliding groove is further formed in the clamping groove, a center rod is arranged in the sliding groove in a matched mode, the diameter of the center rod is the same as that of the sliding groove, the center rod can rotate and slide in the sliding groove, and a polygonal plate is installed on the center rod and can be in the shape of a regular triangle, a square, a regular pentagon, a regular hexagon and the like. According to the technical scheme, the rotating center rod can drive the polygonal plate to rotate, the motion state is clearly displayed, and observation is facilitated; the movement track of the polygonal plate can be recorded on paper through a pen, and recording and contrast learning are facilitated.

One or more embodiments of the present disclosure relate to graphics rendering, and in particular to an image rendering method and system based on Boolean operations of simplified contour polygons. The method comprises the steps of: placing two simplified contour polygons to be processed by Boolean operations in an xoy rectangular coordinate system; searching for and splitting edges of the simplified contour polygon on the basis of inflection points, searching for intersection points between the edges of the two simplified contour polygons, and splitting the edges of the simplified contour polygons again on the basis of the intersection points; traversing the edges of the two simplified contour polygons, and labeling both sides of each edge with annotations representing internal and external attributes of the two simplified contour polygons; screening for target edges and target sides on the basis of the Boolean operations; and connecting all the target edges, obtaining a result region on the basis of the target sides, and filling the result region with a pre-configured color.

A bone scaffold structure may include one or more scaffold units, wherein each of the scaffold units comprises a first end profile, a second end profile, and one or more wires connecting the first end profile to the second end profile. Each of the first end profile and the second end profile may be defined by a polygon surface that is specified by a center and a number of vertices that are pairwise connected by a side. Each of the one or more wires may be specified by a wire length and a substantially circular cross-section with a first end of each of the one or more wires being connected to a vertex of the polygon surface defining the first end profile and a second end of each of the wires being connected to a vertex of the polygon surface defining the second end profile.

The invention belongs to the technical field of ship block two-dimensional irregular layout, and discloses a ship block layout method based on a critical polygon and a dynamic niche. The method comprises the following steps: constructing an NFP solving method based on an edge-vertex contact point convex hull to obtain a critical polygon, constructing a BL positioning stacking strategy on the basis to determine a feasible region, realizing accurate positioning of the irregular polygon, and calculating the fitness; designing a multi-stage adaptive genetic algorithm parameter collaborative optimization method, and dynamically adjusting genetic algorithm parameters based on population diversity and fitness variance; a dynamic niche management and crowding punishment mechanism is introduced, premature convergence of populations is avoided, and diversity of solutions is maintained; and carrying out refined optimization on the polygon rotation angle through genetic post-processing, and preferentially selecting a layout scheme. According to the method, the space utilization rate of the two-dimensional irregular layout can be effectively increased, the complex shape characteristic of the segments is fully reserved in the stacking process, and the method is suitable for the segmented stacking scene of ship construction.

A device may receive an architectural floor plan of an interior of a building, and may process the architectural floor plan, with a vectorization model, to generate a vectorized floor plan of polygons. The device may process the vectorized floor plan, with a convex hull model, to create convex hull polygons around the polygons of the vectorized floor plan, and may reduce a quantity of vertices associated with the convex hull polygons to generate simplified convex hull polygons. The device may generate, based on the simplified convex hull polygons, one of a visibility graph that identifies potential paths through the interior of the building, or a walking path network through the interior. The device may process the one of the visibility graph or the walking path network, with a pathfinding model, to identify paths through the interior of the building, and may perform actions based on the identified paths.

Described herein is a method for generating a mask pattern to be used in a patterning process. The method comprises: (P301) obtaining (i) a first feature segment comprising a first polygonal portion of an initial mask pattern and (ii) a second feature segment (P302) comprising a second polygonal portion of the initial mask pattern; adjusting (P303) the second polygonal portion at a segment boundary between the first feature segment and the second component segment such that a difference between the first polygonal portion and the second polygonal portion at the segment boundary is reduced; and (P305) combining the first polygonal portion with the adjusted second polygonal portion at the segment boundary to form the mask pattern (330).

Aspects of the disclosure includes methods and apparatuses for coding connectivity information of a polygon mesh. A method for decoding the connectivity information includes selecting an active vertex from a plurality of active vertices in a plurality of vertices as a pivot vertex that is to be processed based on a priority of the active vertex. The priority of the active vertex is based on one of (i) a number of processed faces to which the active vertex is incident, (ii) a sum of an angle of each processed incident corner of the active vertex, (iii) a number of unprocessed faces to which the active vertex is incident, and (iv) a number of unprocessed face fans to which the active vertex is incident. The connectivity information of the polygon mesh is reconstructed using the selected active vertex as the pivot vertex.

A container is provided and includes a top wall, a bottom wall, and a plurality of sidewalls defining a plurality of side corners. Each of the side corners includes a top corner. At least one of the top corners has a plurality of spherical polygons including at least a first spherical polygon having a first radius of curvature contiguous with a second spherical polygon having a second radius of curvature.