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

The invention relates to the technical field of automatic driving, and discloses a collision detection method and device, a vehicle and a storage medium, and the method comprises the steps: building a geometric model of an obstacle when a vehicle is in a turning working condition and a sensing system recognizes that the obstacle in front is a concave polyhedron; decomposing the geometric model of the obstacle by adopting a convex decomposition algorithm to obtain at least two convex polygons; constructing a candidate separation axis set based on the geometric model of the vehicle and each convex polygon; performing unitization processing on the vector of each separation axis in the candidate separation axis set, and performing de-duplication on the unitized vector based on a hash algorithm to obtain a de-duplication candidate separation axis set; removing approximately parallel axes according to the included angles between the separation axes in the de-weighting candidate separation axis set to obtain a target separation axis set; and sequentially performing projection judgment on the separation axes in the target separation axis set, and if the projections on any separation axis are not overlapped, judging that there is no collision risk.

The invention provides a live broadcast automobile marketing flow fluctuation prediction method and system, and relates to the technical field of cross-domain fusion, and the method comprises the steps: synchronously collecting data in a live broadcast platform and cross-domain extension data, and generating a platform data set and a cross-domain data set; based on the cross-domain data set, constructing an association space of the social hot events and the vehicle type attributes through a mirror image algorithm, and when the event feature intensity of the association space exceeds a preset threshold value, generating an event influence feature value; based on the event influence characteristic value and the platform data set, generating a basic flow prediction curve according to a fixed period and selecting a key point set; and processing the key point set through a convex hull algorithm to generate a convex polygon region. According to the invention, through constructing a full-link closed-loop design of data acquisition-event association-traffic prediction-parameter optimization-promotion triggering-verbal skill adjustment, accurate control of live broadcast automobile marketing traffic fluctuation and improvement of the marketing effect are realized.

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

There is provided a method and an intersection testing module for transforming a ray and a convex polygon in a ray tracing system, from a space-coordinate system into a ray-coordinate system, for performing intersection testing of the ray with the convex polygon, wherein the ray and the convex polygon are defined in the space-coordinate system, wherein the ray-coordinate system has an origin at an origin of the ray. The method comprises: obtaining a ray direction vector comprising at least components Dx,Dy,Dz, the ray direction vector representing the direction of the ray in the space-coordinate system. The method further comprises, before performing intersection testing of the ray with the convex polygon: selectively reversing the components of the ray and vertices defining the convex polygon to ensure that all components of the ray direction vector are non-negative in the space-coordinate system; selectively permuting the components of the ray and the vertices defining the convex polygon to ensure that Dz is the component of the ray direction vector with the greatest magnitude, wherein after the selective permutation and selective reversing Dz ≥ Dx ≥ 0 and Dz ≥ Dy ≥ 0; and translating the vertices defining the convex polygon by subtracting the origin of the ray from the positions of the vertices defining the convex polygon.

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 two-dimensional full coverage path planning method for a mobile robot and related equipment, and belongs to the technical field of robot full coverage path planning. In a complex two-dimensional environment model, for example, a two-dimensional map in which irregular obstacles and concave-convex polygon obstacles exist, firstly, Maklink lines generated by Maklink graph theory can effectively divide the map into multiple sub-regions, which is helpful to simplify the path search problem and improve the search efficiency; then, the order in which the robot visits each sub-region is calculated, and the optimal path for the robot to switch between each sub-region is calculated; finally, the Boustrophedon path is used for "bow" shape traversal, which can ensure that the robot efficiently covers the entire sub-region, reduces the possibility of omission and repeated cleaning, and moves between sub-regions according to the optimal switching path and the visiting order, which is helpful to reduce the repeated path and invalid movement of the robot when traversing the sub-region.

The invention relates to a method for measuring the penetration track of a closed multi-layer target, which is used for solving the technical problem that the penetration track in the closed multi-layer target cannot be obtained by the existing method for recording the penetration track of a projectile body on the side surface of a multi-layer target plate by using a camera. The interior of the closed multi-layer target is scanned through the laser radar, the original point cloud data of the bullet hole and the color panoramic image in the bullet hole can be rapidly obtained, the overall penetration situation in the target can be observed, and a macroscopic view angle is provided for researching the penetration effect of the bullet body. According to the invention, the three-dimensional edge points of each layer of bullet hole are projected into the two-dimensional convex polygon, so that the contour and the area of each layer of bullet hole are accurately measured, and the safety risk of manual measurement is reduced.

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 glove former for producing an elastomeric glove. The surface of the glove former is debossed with multiple units of stellate convex polygon. When the glove former is dipped into a synthetic latex formulation, the latex layer facing the glove former is imparted with the protruding textured pattern of the stellate convex polygon, while the latex layer facing away from the glove former receives corresponding depressed textured pattern.

The invention discloses an autonomous parking control method for an autonomous vehicle in an irregular scene. The method comprises the following steps: 1, establishing an autonomous parking kinematic model of the autonomous vehicle; 2, designing a control input constraint of an autonomous parking task; 3, approximately expressing the autonomous vehicle and the obstacle as a convex polygon design obstacle avoidance constraint; 4, designing a terminal-free model predictive control algorithm based on manual reference; based on the kinematics model of the automatic driving vehicle under the low-speed condition, manual reference and obstacle avoidance constraint are introduced on the premise of ensuring the feasibility of the optimization problem by designing a model prediction control algorithm without terminal cost and terminal constraint, the calculation demand is effectively reduced, the solvability of practical application is improved, and the method is suitable for large-scale popularization and application. The method is very suitable for motion control of autonomous parking of the autonomous driving vehicle in an irregular scene, and finally safe and accurate control is achieved.

The invention discloses a flatness error hybrid iteration identification method based on an on-machine measurement point cloud, and relates to the field of precision manufacturing and digital measurement, and the method comprises the steps: collecting three-dimensional point cloud data of the surface of a workpiece through line laser scanning, carrying out the normalization modeling of the three-dimensional point cloud data, and carrying out the mapping through employing a self-adaptive resolution; performing three-dimensional convex polyhedron iterative optimization on the processed point cloud data, and quickly screening and eliminating redundant points; carrying out dimension reduction processing on the screened data from three-dimensional dimension reduction to two-dimensional dimension reduction, and further compressing the data scale by adopting two-dimensional convex polygon iterative optimization; and introducing a key point control strategy based on a minimum region criterion, rapidly solving a flatness error, and outputting a flatness error identification result. According to the method, a mixed iteration solving framework combining convex optimization and key point control is constructed, the point cloud data scale and calculation complexity are effectively reduced, rapid processing of large-scale point cloud data is achieved, and the strict requirements of online measurement for real-time performance and rhythm are met.

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.

Provided is a spectacle lens having a center clear region including an eye point and achieving prescription refractive power of a wearer, and an annular functional region surrounding the center clear region, the functional region having a base region for achieving prescription refractive power, and a plurality of defocus regions having a refractive power different from the prescription refractive power, and the plurality of defocus regions being arranged side by side in an X direction and in a Y direction intersecting the X direction at a predetermined angle in a plan view, and when a convex polygon is assumed which exists in a boundary portion between the center clear region and the functional region in a plan view and which has as a side thereof a virtual line passing through the centers of two or more defocus regions, the centers of the defocus regions not being present inside the convex polygon, and the area of the convex polygon being maximized, the maximum value of the external angles of the convex polygon is 36 degrees or less.

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.