223 results about "Triacontagon" patented technology

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.

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.

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.

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

The invention is suitable for the technical field of part machining, and provides a part layout method, device and equipment and a storage medium. The part layout method comprises the steps that a critical polygon of a part is obtained; according to the offset distance and the critical polygon, the parts are copied to form a part array, reference points of the copied parts are located in the critical polygon, and the reference points are points of outlines of the parts; and the part array is inserted into the pattern corresponding to the plate, and part layout is achieved. According to the part layout method provided by the embodiment of the invention, the production efficiency can be improved.

This design facilitates the production of indexes, offers excellent versatility, and contributes to reducing the manufacturing time of the superstructure. [Solution] The frame member 1 comprises a frame portion 10 including a straight portion or a curved portion, and a mesh structure portion 20 integrally provided with the frame portion in a planar region defined by the frame portion. The mesh structure portion has a plurality of polygonal cells 30 when viewed from a first direction intersecting the planar region. Each of the plurality of cells comprises a plurality of wall portions that form a polygon parallel to the first direction, a plurality of holes formed through each of the plurality of wall portions in a direction intersecting the wall portion, and beam portions provided on adjacent parts of the plurality of wall portions in a direction intersecting the first direction, connecting adjacent wall portions.

The application discloses a map parallel superposition analysis attribute matching method and system based on Hilbert space coding, relates to the technical field of geographic information systems, determines a target region, reads and loads vector polygon data of a source layer and a target layer which need to be subjected to superposition analysis, calculates a geometric center point of each polygon, generates a globally unique Hilbert space code according to a space range, and analyzes the vector polygon data of the source layer. The application generates the globally unique Hilbert space code by calculating the geometric center point of the polygon, avoids the high complexity problem of geometric intersection operation in the traditional method, the uniqueness of the code ensures the accuracy of attribute matching, especially in the massive data scene, the parallel processing of the Hilbert space code significantly reduces the calculation time, meanwhile, the space filling characteristic of the code ensures that the codes of adjacent polygons are similar, further optimizes the locality of attribute transmission, and reduces invalid calculation.

A computer-implemented method for assigning data points from first data to one of several objects, wherein the first data comprises at least three spatial dimensions. Groups of projected data points are formed and assigned to the respective objects, taking into account received information data from two-dimensional bounding polygons and from a bin of the data point by an assignment method such that for overlapping polygons in which projected data points are located within more than one two-dimensional bounding polygon, the groups are formed such that no bin is assigned to more than one of the overlapping polygons at the same time. A device is also provided for data processing to execute the method, and a computer program product, and a computer-readable medium on which the above computer program product is stored.

The application relates to an optimization design method of a polygon-based multi-plane device, comprising the following steps: S1. determining parameters of a polygon-based MPLC device; S2. constructing a topological-mode coupling model to determine a phase compensation amount; S3. generating an initial phase mask according to the phase compensation amount calculated in step S2 and in combination with phase distribution characteristics of a target mode; S4. outputting optimized phase mask parameters based on a genetic optimization algorithm; and S5. simulation verification: building simulation models of different topological structures, inputting the optimized phase mask parameters, simulating a mode evolution process, and analyzing whether a performance threshold value meets a demand. The application solves the problems that a traditional algorithm ignores the influence of a topological structure and the generality of a phase mask is poor, realizes accurate design of different polygon devices, and thus effectively reduces loss and improves shaping effect.

The application discloses a polygon decomposition method, an electronic device and a computer readable storage medium. The polygon decomposition method comprises the following steps: obtaining a to-be-decomposed polygon of an integrated circuit layout; obtaining a plurality of candidate polygon templates from a template library; performing shape matching processing and polygon update iteration processing on the to-be-decomposed polygon and the candidate polygon templates to obtain a shape matching result; and performing polygon decomposition processing on the to-be-decomposed polygon according to the shape matching result to obtain a trapezoidal set for manufacturing a mask after decomposition. According to the scheme of the embodiment of the application, the polygon in the integrated circuit layout can be efficiently decomposed, thereby reducing the decomposition time consumption and improving the universal applicability.

The utility model relates to the technical field of granulation compression rollers, and discloses a compression roller device and a dry type granulator with the compression roller device, the compression roller device comprises two main shafts, the radial section of a first shaft section, suitable for being installed with a compression roller, of each main shaft is a polygon, and the side edges of each polygon are arc edges; the two compression rollers are arranged in parallel in the axial direction, shaft holes matched with the first shaft sections in shape are formed in the compression rollers, and the shaft holes of the two compression rollers are arranged on the first shaft sections in a sleeving mode respectively. According to the compression roller device provided by the utility model, the radial cross section of the first shaft section is arranged to be the polygon of which the side edges are convex outwards or concave inwards to form the arc edges and the chamfers are arranged to be the arc angles, so that the hidden danger that stress is easy to remain on the edge of a working plane of a square column section structure is effectively eliminated, and the uniformity of hardness is better; the polygonal structure changes the distribution mode of roller pressure, avoids the problems of local indentation, sunken deformation, fatigue cracking and the like caused by stress concentration under high load, remarkably prolongs the service life of equipment, and improves the production effect of the dry type granulator.

The invention relates to the technical field of laser repairing, in particular to a laser repairing method, device and equipment and a storage medium. Comprising the following steps: processing AOI equipment data to obtain expanded image data; performing shape analysis on the expanded image data according to a preset Douglas-Pick algorithm to obtain a first convex polygon set; performing fitting processing on the first convex polygon set according to a preset traversal acquisition condition to obtain an outer rectangle; performing geometric analysis on the outer rectangle to obtain geometric parameters; sorting the first convex polygon set according to the geometric parameters and a preset traversal stop condition, and performing laser repair on the sorted convex polygon set based on a preset defect type recognition algorithm to obtain a repaired polygon region; through pretreatment, contour simplification, quantitative analysis and ordered laser repair, the defect treatment efficiency and accuracy are improved, errors are reduced, and the panel repair quality is guaranteed.

A portion of a polygon is appropriately extracted from an image. An image processing system 10 including: an input unit 11 that inputs an image including an extraction target; a detection unit 12 that detects a portion of the extraction target from an input image; a convex hull generating unit 13 that generates a convex hull, which is a polygonal, of the detected portion; a vertex reducing unit 14 that acquires a polygon having a preset number of vertices from the convex hull by repeating a vertex reducing process of eliminating a vertex according to each interior angle of the polygon; and an extraction unit 15 that extracts a portion of the acquired polygon described above from the input image, in which the vertex reducing process is a process of determining a new line based on an area of a region surrounded by the new line passing through a vertex to be eliminated, two sides generating the vertex in the polygon, and two lines acquired by extending two adjacent sides of the vertex in the polygon and generating a polygon after elimination of the vertex using the determined new line and the two extended lines.

The application relates to the field of agricultural machine operation, and provides a harrowing method and device for a concave polygonal field and an agricultural machine. The harrowing method comprises the following steps: obtaining a graph of a concave polygonal field, taking at least one concave vertex as a starting point, and dividing the graph into at least two groups of convex polygons according to at least two segmentation strategies, wherein each group of convex polygons comprises at least two convex polygons; determining a harrowing cost of each group of convex polygons according to an area cost, a quantity cost and a shape cost of each group of convex polygons; determining a target segmentation strategy of the graph according to the harrowing cost of each group of convex polygons; dividing the graph into a plurality of convex polygons according to the target segmentation strategy of the graph; and planning the plurality of convex polygons and a harrowing path between the plurality of convex polygons to complete the harrowing operation of the concave polygonal field, so that the concave polygonal field can be effectively and efficiently harrowed.

The goal is to repair the appearance of thinning hair by selecting the optimal dot formation mode of an automatic dot-forming device that creates dots by moving a needle in and out, thereby forming a dot pattern consisting of numerous dots. [Solution] When applying a dot pattern to a thinning area T1 at the crown of a person's scalp, a regular polygon is drawn on the thinning area T1 with the center 11 of the thinning area T1 as its center. One of several isosceles triangles with the center of the regular polygon as one vertex is selected, and the dot pattern is applied to the selected isosceles triangle 12. This operation is repeated for the number of regular polygons, applying a dot pattern to each isosceles triangle 12 to perform the tattoo.

The invention provides a communication method and a communication device, and the method comprises the steps: generating first compressed data, the first compressed data comprises compressed data corresponding to M geometric structures, the M geometric structures comprise a first geometric structure, the first geometric structure is represented by a first polygon and a first depth value of the first polygon, the compressed data corresponding to the first geometric structure comprises N vertexes of the first polygon and the first depth value, M is an integer greater than or equal to 1, and N is an integer greater than or equal to 3; and sending the first compressed data. The geometric structure is represented through the polygon and the depth, and the compression efficiency and the data transmission efficiency of the sensing data are improved.

The application provides a PCB-based copper skin decomposition method and device, comprising: decomposing the in-hole copper skin in the CAM file into a pattern with only islands; traversing all polygons in the pattern to determine whether there is an in-hole, if yes, selecting a polygon with an in-hole and marking the polygon as a current polygon; setting a cutting line passing through the in-hole to decompose the current polygon into two new polygons; and after there is no in-hole in all polygons, inserting all polygons into the pattern. The application has the beneficial effect that: by setting a cutting line passing through the in-hole in the CAM file, decomposing the two-dimensional pattern in the CAM file into a plurality of polygons without in-holes, and then inserting the plurality of polygons without in-holes back into the CAM file, the machine can recognize the complex polygon, and the production of the PCB film is more convenient and smooth.

The application relates to a one-way scanning method, device, storage medium and simulation method, which are used for layout feature parameter extraction. The method comprises the following steps: scanning all polygons in a layout, recording vertex coordinates of the polygons, and reserving vertical edges and oblique edges of the polygons; traversing the oblique edges of the polygons, obtaining intersection coordinates of the oblique edges and the vertical edges and intersection coordinates of the oblique edges and the oblique edges; determining scanning nodes after removing and sorting all the obtained coordinates, and forming scanning areas between two adjacent scanning nodes; respectively scanning the scanning areas along a first axis direction, reserving effective result edges of all the scanning areas according to a result of Boolean processing of the polygons, and constructing an effective result edge linked list according to a pairing condition of the effective result edges of adjacent scanning areas; and based on the effective result edge linked list, arranging to obtain result polygons as the result of the Boolean processing of the polygons in the layout. Through management of the effective result edges and the linked list, the layout graph scanning processing efficiency is improved.

The present invention relates to an improved waterproofing panel, comprising a plurality of sections with a predominantly flat and polygonal geometry, and said sections being enabled to be arranged and fitted one after the other in an extension of their own flat geometry; wherein each section is made up of a rigid and flat core of the same polygonal geometry as the section itself and a waterproofing sheet superimposed on the core and joined to one another, wherein the sheet is covering the core and said sheet has projections that extend and protrude from the core on two contiguous sides of the same core; so that in the arrangement of the sections one after the other, the projections of the sheet of one section are superimposed on the other adjacent section.

A work holding device for removably attaching work pieces to the device. The work pieces may be provided with elongated wedge shaped channels along two sides thereof and an indexing aperture on their bottom surfaces. The work holding device has a body with one or more open slots for receiving clamping assemblies and has a first and second cavity configured to receive spring-biased locating pins. The one or more open slots may have the shape of a rounded polygon in cross section. The clamping assemblies have first and second wedge portions that engage with the channels on the sides of the work pieces to hold the work piece in position during machining operations. The materials and construction of the work holding device provide for strength, stability and precise positioning to optimize machining operations and reduce errors and waste.

The application provides a TIN network construction method based on a spatial minimum spanning tree and a convex hull polygon, relates to the field of geographic information system data processing, and is used for solving the problems of low triangular network quality, topological errors and insufficient construction efficiency in the existing TIN construction method. In order to improve the construction quality of the TIN and maintain the global optimality, the spatial minimum spanning tree and the convex hull polygon of an input scattered point set are constructed in advance in the application, and then the two geometric structures are used as a framework to construct the TIN. In the growth process of the TIN, it is ensured that each generated triangle has excellent morphological characteristics (satisfying the "empty circumscribed circle" or "minimum angle maximization" condition) and topological correctness, and finally a high-quality irregular triangular network is constructed. Meanwhile, a "skip" mechanism of edges and points is provided, invalid traversal is avoided in the triangular network construction process, and the time efficiency of the algorithm is maximally improved.

The nut is configured to be secured within a hole in a component. The nut includes an inner polygonal body, an outer polygonal body, and a pair of arms connecting the inner polygonal body and the outer polygonal body to each other. The arms allow the inner polygonal body to move relative to the outer polygonal body from a first position in which a majority of the inner polygonal body is disposed outside the outer polygonal body to a second position in which a majority of the inner polygonal body is disposed within the outer polygonal body. When the inner polygonal body moves from the first position to the second position after the arm is inserted through the bore in the component, the arm deforms radially outward such that a portion of the component surrounding the bore is captured between the annular flange on the outer polygonal body and the arm.

This invention discloses a method for optimizing the design of complex equipment based on a hybrid adaptive sampling surrogate model. This method divides the design space into several Voronoi polygons controlled by sample points. Three indices—leave-one-out error, local nonlinearity, and polygon region size—are used to evaluate the importance of each sample point region. An entropy-weighted distance method is used to select the most suitable sensitive region for adding points. A learning function based on error estimation is then combined to determine new sampling points. This iterative update constructs a high-precision surrogate model, establishing a mapping relationship between design parameters and optimization objectives, thereby solving the design optimization problem. This invention innovatively proposes a multi-index adaptive weight allocation method to select sensitive sample regions and proposes a novel learning function to determine the location of added points. This method can construct a high-precision surrogate model using fewer sample points and can be used for the optimization design of complex equipment, including but not limited to tunnel boring machines.

The utility model discloses a multifunctional geometric drawing ruler which comprises a ruler body, and the ruler body is provided with a first circle drawing mechanism, a second circle drawing mechanism, a stereogram drawing mechanism, an angle measuring mechanism and a plurality of graph hollow-out areas. According to the multifunctional ruler, the first circle drawing mechanism, the second circle drawing mechanism, the stereogram drawing mechanism, the angle measuring mechanism and the graph hollowed-out areas in various shapes are arranged on the ruler body, so that straight lines and curves can be drawn, various angles can be read and drawn, and various sectors, arcs, polygons and stereoscopic graphs can be drawn; the circle drawing device further comprises another circle drawing mechanism with a pressing type circle center positioning button as a core, the sharp bottom of the pressing type circle center positioning button can be positioned on paper so as to play a role of a circle center, then a limiting block is adjusted to a proper position, a fastening bolt is screwed to fix the limiting block, and the circle drawing mechanism is used for drawing circles or concentric circles with different sizes. Therefore, radius adjustment is completed, and a larger circle can be drawn by rotating the ruler body with the pressing type circle center positioning button as the circle center.

A method for additively manufacturing a part using a device comprising a first deposition head and a second deposition head, said method comprising the steps of: finding (ED) the largest subpolygon symmetrical about the longitudinal axis and inscribed in a polygon; dividing (EE) the subpolygon along the longitudinal axis into a first portion and a second portion, said first portion and said second portion having substantially equal areas; adding (EF) a filling path for the first portion and a filling path for the second portion to a list of filling paths for the first deposition head and a list of filling paths for the second deposition head respectively; and performing (EJ) additively filling a part. Abstract figure: Figure 3.

The application provides a parking space type arrangement method and system. The method comprises the following steps: based on an arranged center parking space scheme, all edges of a maximum contour line of an inner ring center parking space are obtained, each edge is offset outward by a parking space length, a polygon is formed, and collision is performed between the polygon and a building object; after a shear wall region is obtained, the polygon is detected to obtain shear wall bodies and core tube surface regions of the building object currently touched; the shear wall region polygon is divided into N barrier-free polygons by using start and end v lines; the N barrier-free polygon regions are matched in sequence according to size conditions of standard parking spaces and disabled parking spaces, and reasonable parking spaces are collected to form outer ring parking spaces of a garage. The parking space type arrangement method and system provided by the application can generate outer ring parking spaces of a garage, accurately identify a shear wall region under a building, arrange parking spaces for the shear wall region, and ensure the accuracy of overall scheme design.

An object is mounted within a housing of a coffee machine by a mounting which is to provide vibration damping for the object. The mounting includes a set of at least three springs, each having a top end coupled to the housing and a suspended bottom end at which the object is supported. The top ends define an upper polygon and the bottom ends define a lower polygon. A center of gravity of the object is along a vertical line which passes through the lower polygon, and springs are angled inwardly towards the lower polygon.