70 results about "Convex polygon" patented technology

The invention provides a forest resource remote sensing data spatio-temporal change analysis method and system, and relates to the technical field of data processing, and the method comprises the steps: carrying out the ground object type classification processing of each pixel according to a spectral unmixing processing result, and generating a forest coverage distribution diagram; extracting all pixel center points on the boundary of the change region as an input point set by using the forest coverage distribution map of the plurality of time points; finding out the outermost points in the input point set through iterative calculation, and connecting the points to form a convex polygon; performing standardized integration on the shape and the range of the change area based on a convex polygon to obtain a standardized description result; calculating the annual change rate of the forest area based on the normalized description result; and calculating vegetation coverage and forest biomass ecological indexes based on the annual change rate of the forest area. According to the method, more accurate and coherent monitoring and evaluation of the space-time change of the forest resources can be realized.

The invention relates to a robot dog dynamic balance and fall self-recovery method and device for a complex terrain, and the method comprises the steps: building a robust local elevation map through fusing multi-sensor data and quantifying the motion uncertainty of a robot; and a safe foot region set defined by the convex polygon is extracted through geometric feature analysis and plane segmentation. Then, collaborative planning of the trunk and the landing point is carried out in combination with a user instruction and the region set. In a control layer, a nonlinear model predictive control algorithm is adopted, a safety area is used as a hard constraint, and incomplete speed constraint is applied to a wheel type foot end, so that an optimized trunk track and a foot end force reference are output. The whole-body controller converts an upper-layer instruction into an accurate joint torque through a multi-task optimization framework with a weight. When instability is detected, the system can autonomously plan and execute a recovery action sequence including curling, controllable rolling and cooperative supporting.

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 provides a method and a system for determining operation nodes in an organoid culture process, and relates to the technical field of data processing, and the method comprises the following steps: carrying out interval division on a state track curved surface to obtain a plurality of physiological state intervals; performing convex hull algorithm calculation on the data point set in each physiological state interval, obtaining distribution boundary characteristics of the data points by constructing a minimum convex polygon, and obtaining morphological dynamics indexes based on the distribution boundary characteristics and change gradient calculation; performing normalization calibration processing on the monitoring data according to the morphodynamic indexes to obtain a calibrated growth state evaluation value; comparing the calibrated growth state evaluation value with a preset operation threshold value to obtain a comparison result; and determining an operation node of the organoid growth state based on a comparison result. According to the method, the operation node of the organoid culture can be accurately determined, and the controllability of the culture process and the stability of the growth state of the organoid are effectively improved.

This invention relates to a path planning method for homotopy classes in planar mobile robots, based on sunlight sampling. The method includes dividing a two-dimensional planar map to be searched into a topological map composed of obstacle modules and free convex polygon modules using convex decomposition. Simultaneously, it records the relationships between convex polygon modules and their vertices, as well as the datasets of convex polygon modules and their adjacent convex polygon modules. A heuristic function is set to expand from the starting block, continuously recording the blocks traversed by the path and excluding parent and ancestor blocks to prevent path looping when advancing an adjacent block. Upon reaching the target block, the method stops and records a set of non-repeating path blocks as a path homotopy class. Sunlight sampling is performed on each path homotopy class to obtain the intra-class shortest path. This invention can quickly search for path homotopy classes in the topological map and uses the sunlight principle to search for intra-class shortest paths, achieving rapid partitioning of path homotopy classes and significantly improving the search efficiency for intra-class shortest paths.

This disclosure provides a method, apparatus, device, medium, and product for perceiving traversable road areas. The method includes: acquiring environmental data collected by sensors on a vehicle; determining a set of target key points in the external environment of the vehicle to be avoided based on the environmental data; generating a convex polygon representing the traversable road area using the target key point set; adjusting the shape of the convex polygon based on the target key point set and preset polygon constraints to obtain a reference concave polygon representing the traversable road area; and determining the traversable area of ​​the vehicle based on the reference concave polygon, so as to control the vehicle's driving state based on the traversable area. In the embodiments of this disclosure, the vehicle can effectively perceive and promptly avoid impassable areas while driving, which helps ensure safe vehicle operation.

The application provides a Manhattan mask generation method, device, medium, program product and terminal of a convex polygon mask, and the application generates a buffer area by using a buffer area technology, and performs Manhattan in the area. The purpose is to combine multiple line segments in the convex polygon and then perform Manhattan, so that fewer Manhattan edges can be generated to approximate the original mask pattern, and the problem that a jog or fragmented line segment is easily generated in the traditional Manhattan optimization can be solved. The application also cuts the convex polygon into left and right parts, simultaneously performs Manhattan on the left and right parts, so that the finally generated convex polygon Manhattan mask has left-right point symmetry, avoids secondary rectangularization, saves the slicing step during subsequent mask printing, improves the production efficiency, and avoids the generation of a jog again.

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 application discloses a point-based shape contour recognition method, which comprises the following steps: constructing a standard pattern library, wherein the standard pattern library comprises regular patterns or custom patterns, and the picture size in the standard pattern library is recorded as m*n; obtaining point data of each shape in a to-be-recognized drawing; adopting a clustering algorithm to divide a group of points into different clusters in space, applying a convex hull algorithm to each cluster to obtain a convex polygon wrapping all points in the cluster; compressing the convex polygon to the size of m*n to form a standard convex polygon, and recording a compression rate; comparing the standard convex polygon with each pattern in the standard pattern library by IoU to obtain a pattern in the standard pattern library with the highest score as a predicted contour of the convex polygon; and then reflecting the original size according to the compression rate based on the predicted shape to obtain a result, so that the shape contour recognition in the drawing is realized. The method can be applied to recognition and analysis of various shapes, and has the characteristics of high efficiency, stability and wide applicability.

A nonwoven body according to the disclosure includes a plurality of metal fibers each having a cross section orthogonal to a longitudinal direction, the cross section having a profile that is convex polygonal.

The application provides a high-speed motor operation data intelligent analysis method and system, and relates to the technical field of data processing.The method comprises the following steps: performing a preprocessing operation on basic operation information and surrounding working condition factors to form initial integrated information; performing boundary contour calculation on a multidimensional data point set for the initial integrated information, and extracting an outer convex boundary point set of data distribution; determining a coverage range of data distribution based on the outer convex boundary point set, and establishing a minimum convex polygon verification interval containing all data points; performing adaptive hierarchical cutting on the verification interval according to a data density gradient and a working condition change amplitude to form a plurality of cutting sub-regions with different characteristic densities; extracting geometric features, distribution densities and boundary curvatures of each cutting sub-region as characteristic parameters, and mapping and converting the characteristic parameters into stability evaluation parameters and abnormality evaluation parameters of corresponding verification points.The application realizes accurate evaluation, real-time abnormality identification and dynamic adaptation of the running state of a high-speed motor.

This invention discloses a method for constructing a microscopic model of recycled concrete and simulating chloride ion erosion based on recursive region segmentation and random convex polygons. The method includes: initializing model parameters; generating a first layer of aggregate and its intermediate zone (ITZ) using a subtractive placement strategy based on recursive region segmentation; subtracting the aggregate and its ITZ from the effective placement area using Boolean subtraction to update the effective placement area; generating a second layer of aggregate candidates within the remaining area; performing adhesion screening by calculating the Boolean intersection area of ​​the second layer aggregate with the first layer aggregate; merging all the first layer aggregates and shifting them outwards to generate a new ITZ; constructing a five-phase microscopic geometric model and exporting it as a standard file; importing the geometric model into simulation software; assigning different diffusion coefficients to the five phases; and performing transient simulation of chloride ion erosion. This invention significantly improves aggregate placement efficiency through recursive region segmentation and Boolean operations, realistically reflecting the multi-layered structure and interconnected interface areas of recycled concrete, and achieving seamless integration of modeling and simulation.

The application discloses a laser radar obstacle profile polygon construction method based on polar coordinate angle partitioning, which comprises the following steps: acquiring obstacle point cloud data collected by a laser radar, converting point cloud coordinates into polar coordinates, and performing dynamic angle partitioning on a circumferential space according to a current vehicle speed; extracting description points representing the partition boundary from the obstacle point cloud, and removing outliers; for an empty partition without effective points, interpolating compensation is performed based on adjacent effective partitions and the vehicle speed to obtain a continuous initial boundary point set; clustering the point cloud to obtain corresponding obstacle point cloud clusters, associating the initial boundary description points with the corresponding obstacle point cloud clusters, and arranging the initial boundary description points in angle sequence to form an initial profile polygon of a target obstacle; performing segmentation on the initial profile polygon based on the concave-convex judgment of the profile points to obtain a plurality of convex polygons, performing safety distance expansion on the polygon boundaries after segmentation, and outputting a final obstacle profile polygon.

The invention discloses a scanner equipment image paper folding angle detection method and system, a medium and a product, and relates to the technical field of image processing. According to the method, firstly, a scanning image is obtained and converted into a grey-scale map for edge detection, and a boundary point set is extracted through bidirectional scanning; and performing region division on the boundary point set, extracting corner region boundary points, constructing an angle histogram, screening a dominant angle sequence, and outputting a first break angle detection signal. And if no break angle is detected, straight line detection is carried out to determine grouped straight lines, a base line is selected to carry out rotation correction, and the paper boundary is determined and cutting is carried out. And extracting a corner region sub-image from the cut image, and performing convex polygon fitting to output a second break angle detection signal. And finally, determining a final break angle detection result according to the two detection signals. By implementing the technical scheme provided by the invention, the accuracy of paper folding angle detection can be improved.

This invention proposes a method for optimizing the spatial configuration of flexible photovoltaic (PV) support structures, comprising: obtaining the flexible support layout parameters; dynamically shrinking the layout area based on the centroid calculation and rotation alignment of CAD convex polygons to generate a safe layout boundary; determining the insertion point position of the end column and generating three-dimensional terrain profile data of the flexible support axis according to the safe layout boundary and the rotated terrain features; using an arc intersection tracking algorithm to iteratively calculate the spacing between the middle columns with the end column position as the initial point, forming a continuous middle column positioning sequence; and generating a short-span structural layout table containing the number of components, tilt angle, and three-dimensional coordinate information by combining short-span vector calculation and plane normal direction determination. This invention enables the optimal spatial configuration of flexible PV support structures within complex terrain-defined areas, effectively improving power generation efficiency, reducing the impact of shading, and enhancing the overall stability of the system.

The invention provides a fragment penetration target contour recognition method, device and equipment and a storage medium, and relates to the technical field of ammunition engineering. The method comprises the following steps: acquiring fragment hole coordinates of a target surface to obtain fragment points; according to the fragment hole coordinates, fragment points are projected to a projection plane, and projection points corresponding to the fragment points are obtained; determining a minimum convex polygon surrounding the projection points to obtain a projection two-dimensional contour line; generating rays perpendicular to the projection plane for the projection points on the projection two-dimensional contour line, and determining intersection points of the rays and the target surface; and connecting the intersection points to obtain a three-dimensional contour, and performing curved surface optimization on the three-dimensional contour based on the fragment points to obtain a three-dimensional contour curved surface of the surface of the fragment penetration target. The problem that the three-dimensional contour of the surface of the fragment penetration target cannot be correctly and effectively identified in the prior art can be solved.

The application provides a device for monitoring the working state of a metering pump and liquid flow, and relates to the technical field of metering pumps, and comprises the following steps: extracting time sequence data of floating ball jumping from the jumping signal; constructing a trajectory point set of floating ball jumping in a two-dimensional coordinate system according to the time sequence data; performing operation on the trajectory point set, calculating a minimum convex polygon containing all trajectory points in the trajectory point set, and the minimum convex polygon is a convex hull of the trajectory point set; calculating a geometric feature parameter of the convex hull, comparing the geometric feature parameter with a preset flow normal threshold range, and if the geometric feature parameter exceeds the preset flow normal threshold range, judging that liquid flow is interrupted; and triggering an alarm when it is judged that liquid flow is interrupted. The application can accurately and reliably analyze the monitoring device of the fluid flow state, so as to truly reflect the working state of the metering pump and the liquid flow condition.

A computer-implemented method includes creating a list of intersecting convex polygonal faces based on results of a constructive solid geometry operation that is applied to a first object and a second object. The method further includes generating a first treelet from a first set of faces associated with the first object. The method further includes identifying whether first fragments in the first set of faces are inside second objects. The method further includes creating a second treelet. The method further includes identifying whether second fragments in the second set of faces are inside the first object. The method further includes responsive to the identifying, determining whether there is a union, intersection, or subtraction for each pair in the list of intersecting convex polygonal faces. The method further includes assembling the set of first fragments and the set of second fragments to create a topological structure.

This invention discloses a safe trajectory planning method, system, and robot for autonomous navigation of an inspection robot. The method includes the following steps: performing tight-coupled filtering on LiDAR point clouds and IMU data to obtain registered point clouds; constructing a 3D map based on a probabilistic occupancy grid (OctoMap); fusing robot collision boxes in the map and performing RRT-star planning to obtain an initial path P; generating a convex polygonal safe corridor sequence Q; using Minimum-Snap optimization to generate a smooth trajectory Traj; and performing numerical solutions using a sparse matrix and a convex optimization solver. This invention ensures trajectory collision safety and dynamic feasibility through safe corridor constraints, improving the robustness and real-time performance of inspection robot navigation in complex application scenarios such as intelligent inspection in petrochemical enterprises.

The invention provides a convex polygon roadway surrounding rock stress calculation method, belongs to the technical field of underground engineering technologies, and solves the problems that an existing calculation method is low in efficiency, single in applicable scene and incapable of accurately reflecting the actual stress state. According to the convex polygon roadway surrounding rock stress calculation method, roadway surrounding rocks are numbered as a plurality of planes, the equivalent concentrated force borne by each plane is calculated through the Gaussian integral of the w-order Legendre polynomial, and the stress of any point in the roadway surrounding rocks is obtained based on force balance calculation. According to the method, the calculation process is not limited by the shape of the roadway, the method is suitable for stress calculation of various polygon-shaped roadways, the actual load borne by the roadway can be fully simulated, the effect of concentrated force on the roadway and the effect of distributed force are considered, the roadway construction load influence is truly reflected, and the stress around the roadway and the roadway corner points can be calculated; the calculation precision is high, and the singularity characteristics of the roadway corner stress can be accurately reflected.

The application provides a kind of unmanned aerial vehicle cluster path planning method for forest fire edge, first obtain the quasi-forest fire edge graph after edge expansion, and calculate to obtain scanning range convex polygon, the distance of discrete point in fire area to each side of scanning range convex polygon is solved, the shortest distance is regarded as the importance index of the discrete point, and according to the index, draw the equal importance line graph, and the different regions in the graph are weighted, the spacing of adjacent path of unmanned aerial vehicle scanning in the region is determined according to the weight of region, to improve the lateral overlap rate of edge region unmanned aerial vehicle scanning, so as to improve the aerial image precision of unmanned aerial vehicle;Then construct multi-unmanned aerial vehicle scanning range distribution function and unmanned aerial vehicle three-dimensional path cost function, the optimal position of range segmentation ray and the best three-dimensional path planning are solved by using particle swarm optimization algorithm and genetic simulated annealing algorithm.The application is reliable and practical, and has good adaptability for unmanned aerial vehicle cluster path planning in forest fire scene.

The application discloses a flight pipeline modeling method for cluster unmanned aerial vehicle control, and establishes a geometric pipeline model of unmanned aerial vehicle flight; a profile model of a convex polygon section is established based on rotation angles and lengths of convex vectors, and the convex polygon section is composed of a plurality of convex vectors; nodes are constructed by positions of the convex polygon section on a reference curve, the rotation angles and the lengths of the convex vectors, the geometric pipeline is discretized into a plurality of node sequences, a curve fitting algorithm is applied to the node sequences to generate a continuous three-dimensional pipeline model; a comprehensive cost function of the geometric pipeline is established according to characteristics of the geometric pipeline; and the optimal geometric flight pipeline model is obtained when the comprehensive cost function is the minimum. The flight pipeline is modeled by the reference curve and the convex polygon section, a polygon geometric pipeline is obtained, and safe flight space modeling in a complex three-dimensional scene is realized.

A microlens array (1100) equipped with a plurality of microlenses and formed as the only component comprising a collimator lens (1200), wherein each microlens has: N sides (S) of a convex polygon, a microlens vertex (T) located from a face of the convex polygon, and N curved surfaces (CS) separated by lines connecting the microlens vertex (T) and the N vertices of the convex polygon, and where the straight line passing through the microlens vertex (T) and perpendicular to the face of the convex polygon is defined as the z-axis, the intersection point between the z-axis and the face of the convex polygon is defined as the origin (O), and the straight line in the face of the convex polygon passing through the origin (O) and perpendicular to a side (S) of the convex polygon is defined as the x-axis, the z-coordinate of the curved surface corresponding to the side (S) is represented by z = f ( x ) , where t is a distance from the origin (O) to the side (S), n is a refractive index of a microlens material, A is a non-negative constant, C is a positive constant, and g(x) is defined by g ( x ) = − x | x | ⋅ C x 2 + A n 1 + ( C x 2 + A ) 2 − 1 where each microlens is designed in such a way that g ( x ) − 0.035 ≤ df ( x ) dx ≤ g ( x ) + 0.035 for 0.25·t < |x| ≤ t.

The nonwoven body of the present invention comprises a plurality of metal fibers having a convex polygonal shape in cross section orthogonal to the length direction.

The pin-fin heat sink is characterized in that: a plurality of heat dissipation columns are arranged in cross on a heat dissipation surface of a substrate; a cross-sectional shape of the heat dissipation column is an axisymmetric convex polygon, and an axis of symmetry of the axisymmetric convex polygon is parallel to a flow direction; a plurality of side surfaces of the heat dissipation column are sequentially divided into a flow surface facing the flow direction, a pair of parallel side surfaces parallel to the flow direction and a backflow surface facing away from the flow direction along the flow direction; the flow surface sequentially includes a directly facing flow surface and a pair of obliquely facing flow surfaces along the flow direction, and the directly facing flow surface is perpendicular to the flow direction; the two obliquely facing flow surfaces are symmetric about the axis of symmetry, and the two obliquely facing flow surfaces are obliquely away from each other along the flow direction; the pair of parallel side surfaces includes two parallel side surfaces parallel to the flow direction, and the two parallel side surfaces are symmetric about the axis of symmetry; and the backflow surface includes at least a pair of backflow inclined surfaces, the two backflow inclined surfaces are obliquely toward each other along the flow direction, and the two backflow inclined surfaces are symmetric about the axis of symmetry.

The present application relates to the technical cross field of cross-border railway transportation, and provides a method and system for intelligent loading of Central and Eastern Europe block train containers for international supply chains, comprising responding to a block train container loading task request; obtaining loading basic data corresponding to the target block train from a multi-source data interface based on the loading task request; constructing a continuous space model for the target container, introducing a heavy convex polygon stability algorithm to establish stability constraints, and using a deep reinforcement learning model based on Transformer to determine a target loading scheme; when it is detected that the load distribution state does not satisfy the preset constraint condition, a new container loading scheme is calculated by performing local adjustment. By constructing a continuous loading state space, the space rounding error caused by gridding is eliminated, the container space utilization rate and the overall loading rate are improved; at the same time, the loading efficiency is improved under the premise of ensuring the loading quality, and the safety risk in the transportation process is reduced by introducing a physical perception mask mechanism in the model.

The application discloses an arbitrary area surface array coverage imaging path planning method based on angle mapping and belongs to the field of remote sensing satellite splicing imaging. The method comprises the following steps: according to the imaging start time extrapolation satellite orbit parameters of the target area mapping to the attitude angle phase plane, the initial attitude angle pointing to each vertex of the target area is calculated; whether the target area is a concave polygon is determined according to the polar angle and distance from the geometric center of the target area to each vertex, if yes, the vertex with an inner angle greater than a preset threshold is deleted and the remaining vertex is used to construct a convex polygon covering the original area; grid division and path planning are carried out according to the initial attitude angle of each vertex of the target area and the number of vertices of the convex polygon, and the initial imaging path and the initial time sequence of the satellite are obtained; the initial imaging path and the initial time sequence are updated and checked, and the final imaging path with the highest coverage efficiency of the target area is obtained. The application can improve the imaging efficiency of the remote sensing satellite.

The invention relates to a coverage type path planning method suitable for any polygonal region, which comprises the following steps of: firstly, carrying out region acquisition, acquiring boundary points, converting longitudes and latitudes of the boundary points into a ground fixed coordinate system, and verifying that a line segment set formed by a boundary point sequence has no self-intersection; secondly, carrying out region modeling, judging the type of a polygon based on a boundary point sequence, if the polygon is a concave polygon, calculating an optimal segmentation strategy through a nonlinear weight table, and decomposing the polygon into a plurality of convex polygon sub-regions meeting the constraint conditions of the minimum number and the maximum area; and determining an optimal access sequence and starting and ending points of each sub-region by taking a preset starting point as a reference. And finally, generating a region full-coverage path, selecting a traversal path type according to geometrical characteristics of each sub-region, and constructing a connection relation of sub-region paths according to starting point and end point sets of the sub-region paths to obtain a complete coverage path of any polygon. According to the method, the complex area coverage type path planning performance can be improved, and the operation efficiency of autonomous equipment is improved.

The application provides a forest resource remote sensing data spatio-temporal change analysis method and system, relates to the technical field of data processing, and comprises the following steps: according to the result of spectral unmixing processing, performing ground object type classification processing on each pixel to generate a forest coverage distribution map; using the forest coverage distribution maps at multiple time points, extracting all pixel center points on the boundary of a change region as an input point set; finding out the points located at the outermost periphery in the input point set through iterative calculation and connecting the points to form a convex polygon; normalizing and integrating the shape and range of the change region based on the convex polygon to obtain a normalized description result; calculating the annual change rate of the forest area based on the normalized description result; and calculating the vegetation coverage and forest biomass ecological indexes based on the annual change rate of the forest area. The application can realize more accurate and continuous monitoring and evaluation of the spatio-temporal change of forest resources.