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

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.

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.

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

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.

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.

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.

An energy calculation unit calculates an energy amount for each of a plurality of sides of a support polygon of a work machine in which the energy amount is required to cause the work machine to fall when the side serves as a rotation axis. An evaluation unit evaluates a possibility of the work machine falling based on the calculated energy amount for each of the sides.

Implementations described herein relate to methods, systems, and computer-readable media to cut between coplanar convex polygons. In some implementations, a method includes obtaining the polygons, constructing a corresponding initial coplanar graph, adding that graph into a queue, and cutting each graph in the queue, the cutting including identifying whether the graph includes at least one concave boundary vertex. If there is no concave boundary vertex, the graph is added to a set of result graphs. If there is at least one concave boundary vertex, the cutting selects a starting vertex, finds an optimal cut from the starting vertex to another boundary vertex, splits the graph into subgraphs along the optimal cut, and queues the subgraphs for cutting. The cutting repeats until a termination criterion is satisfied. The method then outputs the result graphs. Using these result graphs may reduce the use of computing resources, such as in real-time applications.

The invention discloses a spatial distributed observation method based on irregular region geometric feature sampling, and belongs to the technical field of aerospace. The implementation method comprises the following steps: establishing a coordinate system for describing the motion of the spacecraft; establishing a spacecraft dynamic model under the coordinate system; six initial orbit elements of a satellite can be obtained based on existing low-orbit constellation orbit data, the spatial position is calculated through the orbit elements, and then position components are converted into latitude and longitude coordinates, namely sub-satellite point coordinates; defining vertex coordinates of the polygon, and constructing a planar polygon by connecting the vertex coordinates end to end; discretizing the internal region of the closed polygon; on the basis of the kinetic model, on the basis of the coordinates of the sub-satellite point and the center coordinates of the discrete sampling circle, calculating the characteristic distance from the sampling point in the observation area to the sub-satellite point, and on the basis of the size relationship between the characteristic distance and the radius of the observation view field, judging whether the irregular area can be successfully observed in a preset time constraint interval; therefore, spatial distributed observation is realized.

A geometry cleanup method for a 2.5D model for characterizing a layered circuit board structure, comprising: merging adjacent points on the basis of an adaptive quadtree; performing an edge intersection operation; removing a sharp angle; aligning points to edges; simplifying a polygon; and performing local update.

The present invention relates to a method and device for automatically generating a free-form surface spraying path. The method includes: extracting a feature surface according to the free-form surface point cloud data, and determining an index space according to the feature surface and the free-form surface point cloud data; segmenting the original polygon on the feature surface by using the method of sub-polygon division to obtain a plurality of sub-polygon line segment sets, the sum of the areas enclosed by the sub-polygon line segment sets is equal to the sum of the areas of the original polygon, and the sub-polygon line segment sets are connected end to end in sequence to obtain a sub-polygon; performing sub-polygon trajectory planning based on the sub-polygon to obtain a sub-polygon trajectory, obtaining spraying point indexes based on the sub-polygon trajectory and the index space, calculating spraying points and spraying postures according to the spraying point indexes, obtaining a spraying pose path based on the spraying points and spraying postures, and evaluating and outputting the spraying pose path. Compared with the prior art, the present invention has the advantages of being applicable to any free-form surface point cloud data, adjustable spraying width, etc.

The invention provides a polygon clipping processing method based on GPU acceleration, comprising the following steps: forming a minimum frame: reading the shape of a to-be-processed graph to form the minimum frame surrounding the to-be-processed graph, the minimum frame having a plurality of extreme points; the center of a first segmented grid is determined according to one of the extreme points, the segmented grid is a regular polygon, coordinates of all vertexes of the first segmented grid are obtained through calculation according to the center of the first segmented grid, other segmented grids are formed according to center coordinate deviation of the first segmented grid, and the center of the first segmented grid is a regular polygon; the minimum frame is completely covered by the segmentation grids; and kernel clipping: grouping the segmentation grids, performing parallel processing on each group of segmentation grids by using a GPU calculation unit so as to clip each group of segmentation grids edge by edge, and reserving vertexes of the segmentation grids in the to-be-processed graph and intersection points formed by the outer contour of the segmentation grids and the outer contour of the to-be-processed graph.

Systems and methods for defining bounding polygons in a view of a three-dimensional scene. Rays are defined that each extend from a viewpoint of a virtual three-dimensional model to a vertex of an object of interest in the virtual three-dimensional model. A set of occluded rays is determined that include rays intercepting occluding objects in the virtual three-dimensional model prior to reaching a vertex of the object of interest when extending from the viewpoint. A set of visible rays is defined with respect to the object of interest that excludes the occluded set of rays. A bounding polygon for the object of interest that encompasses each vertex intercepted by the set of visible rays and excludes at least one vertex intercepted by a respective ray in the set of occluded rays is defined in an image of the virtual three-dimensional model that is created from the viewpoint.

A combined container cover comprises a central cover body, an outer cover body in the shape of a polygon with a positive even number, at least one first splicing part and at least one second splicing part, the first splicing part and the second splicing part are arranged on the horizontal edge of the side wall of the outer cover body, and a first middle inserting tenon is in the shape that the inner section expands outwards and the outer section is closed in the horizontal direction. An integrated continuous surface is formed between each of the first splicing part and the second splicing part and the side wall of the adjacent outer cover body, the first middle inserting tenon is a slotted hollow cylinder with a lower hole and an inner side cutting groove continuously extending to the top wall, and the first side inserting groove and the second middle inserting groove are both concave inwards to form arched walls. By reasonably arranging the structure of the first splicing part and the second splicing part, any two container covers can form an elastic deformation structure effectively coping with twisting force after being combined through the first splicing part and the second splicing part, the container covers are endowed with the assembling function similar to building blocks, the assembling structure is stable, and good twisting resistance is achieved.

The embodiment of the invention discloses a parking path planning method and device, electronic equipment and a storage medium, and the method comprises the steps: collecting first point cloud data of a current parking space through a vehicle-mounted radar in a process that a vehicle is parked in the current parking space; the first point cloud data is processed, a first polygon corresponding to the current parking space is determined, and the first polygon is used for indicating the contour shape of the current parking space; according to a preset polygon corresponding to the preset parking space and a first polygon corresponding to the current parking space, determining a rotation angle interval meeting a preset rotation condition; wherein the preset rotation condition comprises that the preset polygon is located in the first polygon under the condition that the geometric center of the preset polygon is overlapped with the geometric center of the first polygon and the preset polygon is rotated based on any rotation angle in the rotation angle interval; and planning a parking path according to the rotation angle interval and pre-acquired orientation data and attitude data of the vehicle.

This invention discloses a chip layout image generation method based on a boundary tracking scan line algorithm. By designing a sub-image-polygon data structure and establishing a maximum matrix of adjacent polygons in the sub-image, this method improves the boundary scan line algorithm to quickly segment the complete chip layout into sub-images and generate corresponding binary images. The algorithm designs a sub-image bounding box-polygon bounding box data structure to quickly locate which polygons are most likely to intersect with the sub-image. Saving this data constructs the maximum bounding box of all polygons contained in the current sub-image, eliminating the need for the algorithm to calculate the intersection points of polygons with the sub-image, thus reducing the time consumption for intersection point calculation. Furthermore, a boundary tracking method is designed to improve the scan line algorithm. By saving each point in the boundary, when scanning a row, it is not necessary to calculate the intersection points of the scan line and the polygon boundary, further reducing the algorithm complexity.

The invention discloses a graph scaling method and a design rule checking method of an integrated circuit. The graph zooming method for the electronic design comprises the steps that vertex information and zooming parameters of a polygon are obtained, and the zooming parameters comprise the vertical distance between the edge of the zoomed polygon and the corresponding edge of an original polygon; finding a parallel line corresponding to each edge of the polygon according to the vertex information and the scaling parameter; and searching corresponding intersection points of the parallel lines according to a boundary sequence of new boundaries of the polygon defined by the parallel lines to obtain new vertex information, and obtaining the zoomed polygon. According to the invention, the graph zooming method with high efficiency and high precision can be provided.

The application provides an extendable anchor rod based on a three-dimensional concave polygon structure, which comprises a rigid rod body and a three-dimensional polygon structure arranged on the outer side of the rigid rod body, the three-dimensional polygon structure comprises a plurality of fold line type anchor cables which are connected with each other; when the rock mass deforms and causes the rigid rod body to break, the three-dimensional polygon structure can extend along the direction of the rigid rod body, thereby achieving multi-section rock mass anchoring. The application can realize elastic anchoring of the multi-section rock mass along the radial direction of the rod body, and is suitable for surrounding rock anchoring under different stress and deformation conditions of the multi-section rock mass.

A laser scanning method, device, and storage medium for a powder bed fusion process, wherein the scanning method includes: slicing a part to be printed to obtain a cross-section to be scanned having one or more closed polygons; selecting part or all of at least one polygon as a region to be processed, and filling the interior of the region to be processed with fill lines; all fill lines close to or connected to the contour boundary of the polygon are parallel to each other; and scanning and sorting the parallel fill lines f(k) so that the endpoint of a later scanned fill line that is close to or connected to the contour cannot exceed the adjacent previously scanned fill line. By controlling the scanning order of the fill lines that are connected to or close to the contour, the present invention can accurately control the shape of the molten pool formed by the fill lines, so that the molten pool formed by the later scanned fill lines can adhere to one side of the molten pool formed by the previous scan to the greatest extent possible, which is beneficial to controlling the local temperature gradient of the molten pool and improving the surface quality and density of the part.

The invention relates to the technical field of risk management and control, and particularly discloses a to-be-early-warned insurance policy query method and device based on geometric cutting, equipment and a medium. According to the method, screening is carried out according to the disaster risk type, the to-be-screened insurance policy list is obtained, the number of insurance policies is reduced, geometric cutting is carried out on the disaster risk area according to the preset cutting parameters, at least one convex polygon area is obtained, the disaster risk area with a complex boundary is converted into a simple convex polygon area, and the risk of disaster risk is reduced. The complexity of polygons and the space judgment calculation amount are reduced, so that the insurance policy query efficiency is improved; moreover, the cut convex polygon geometry can completely coincide with the original risk area, so that the edge precision of the risk area is prevented from being reduced, and the policy query accuracy is ensured. The scheme is applied to financial insurance services such as property insurance and agricultural insurance, the insurance policy to be pre-warned with the underwriting address located in the disaster risk area can be quickly inquired, and pre-warning is sent to the personnel to be pre-warned, so that the loss caused by disasters is reduced.

To provide a folding mechanism and a folding chair having a simple and convenient structure, capable of flexibly switching between a rotation mode and a position restriction mode, and having a lock structure. [Solution] The locking structure includes a position limiting block 111 and a position limiting groove 112, and the horizontal projections of the position limiting block and the position limiting groove form a matching polygon or ellipse. When the position limiting block and the position limiting groove are in the correct position, the position limiting block is inserted into the position limiting groove and cooperates with the position limiting groove to realize circumferential position limiting. When the position limiting block disengages from the position limiting groove, the position limiting block and the position limiting groove can rotate relative to each other.