Patents
Literature
Patsnap Eureka AI that helps you search prior art, draft patents, and assess FTO risks, powered by patent and scientific literature data.

8 results about "Delaunay triangle" patented technology

A Delaunay triangulation is a particular way of joining a set of points to make a triangular mesh. Delaunay triangulations tend to avoid skinny triangles. The triangulation was invented by Boris Delaunay in 1934.

A grid mapping method for pool dynamics and phase-field method dendrite growth calculation

The application discloses a grid mapping method for finite element method or finite volume method and phase field method dendrite growth calculation. The application relates to the technical field of welding simulation. Specifically comprises the following steps: step 1, obtaining the field variable distribution in the numerical simulation calculation of the finite element method or the finite volume method welding process; step 2, exporting the coordinates and field variable data of the nodes with the temperature greater than the metal melting point; step 3, performing triangular partitioning on the melting area according to the node coordinates; step 4, drawing the Voronoi diagram of the melting area according to the circumcenters of the Delaunay triangles; step 5, setting the phase field method nodes; step 6, sequentially processing the units in the Voronoi diagram, taking the base point of the unit and the base point directly connected with the base point as known points, and obtaining the field variable value of the phase field method nodes by the interpolation method; and step 7, using the obtained field variable value for the calculation of the phase field method grain growth.
Owner:SHENZHEN AMBER DIGITAL TECHNOLOGY CO LTD

Three-dimensional Mesh grid generation method and device for three-dimensional reconstruction of three-dimensional satellite

A three-dimensional Mesh grid generation method for three-dimensional reconstruction of a stereo satellite belongs to the field of satellite image three-dimensional reconstruction production, and is characterized by comprising the following steps: performing intersection processing on a DSM image and building vector Shp data to obtain a roof DSM and a ground DEM; respectively processing the building vector Shp data, the roof DSM and the ground DEM to obtain three-dimensional vector feature points; performing grid turning point cloud processing on the ground DEM and the roof DSM; constructing a Delaunay triangulation network in a partitioning manner; and combining and outputting a final Mesh grid. By inputting a high-resolution DSM image and building vector Shp data of a corresponding region, extracting topographic features of a reference DEM and inputting the DSM by using a gradient calculation method, and by means of the satellite large-area three-dimensional grid generation method based on building geometric features and the DSM, the defects that the side face of a building is too fine in a satellite large-area three-dimensional scene in a traditional method, and the size of the building is too small can be effectively overcome. The technical problems of obvious splicing seams and unnatural texture transition in the prior art are solved, the existing topographic features are fully utilized, and the precision and attractiveness of the three-dimensional grid can be effectively improved.
Owner:ZHONGKE XINGTU SPACE TECH CO LTD +1

A method for constructing a triangular mesh model based on local optimization of nearest points

The application discloses a kind of triangle mesh model construction methods based on nearest point local optimization.The method of the application comprises the following steps: obtaining the original image of target entity, obtaining planar point set according to the original image, and then constructing initial polygon, the internal area of initial polygon is divided into several grids and is sorted;Initial polygon is disassembled into initial triangle;According to the grid order, insert data points, after inserting each data point, obtain the nearest data point, and then locate all non-Delaunay triangles, delete all internal boundaries of non-Delaunay triangles, generate several new triangles;Finally, all initial polygon related triangles are deleted from the initial triangular mesh model, and the triangular mesh model of the target entity is obtained.The application quickly locates the non-Delaunay triangle in the triangular mesh by the nearest point, optimizes the efficiency of triangular mesh construction, and improves the image processing efficiency based on Delaunay triangulation without changing the triangulation effect.
Owner:ZHEJIANG UNIV

Blind box big head sticker generation method and system based on dynamic grid layout

The invention relates to the technical field of big head sticker generation, and discloses a blind box big head sticker generation method and system based on dynamic grid layout, and the method comprises the steps: carrying out the uniform grid division of an input image based on the dynamic grid layout, and setting a seed point at the center of each grid; by enumerating a triple and executing a hollow circle test, screening units conforming to a Delaunay triangle, further calculating the Euclidean distance between the center of mass of each unit and the center of mass of the image, and normalizing the Euclidean distance into a distortion factor based on a preset maximum distance; constructing an affine distortion matrix and transforming triangular vertex coordinates; according to the method, the structural integrity of the image is ensured, multi-form dynamic distortion and multi-mode resource binding are flexibly supported, and different grid layouts (grids in different shapes), blind box random star IP display and sound resource and timestamp addition can be realized. The grid shape and content distribution are dynamically adjusted through an algorithm, star materials are randomly loaded in combination with a blind box mechanism, and finally the personalized large-head sticker is generated.
Owner:GUANGZHOU FANGTU TECH CO LTD

An unmanned aerial vehicle maritime communication flight path planning method, device and system

The application discloses a kind of unmanned aerial vehicle maritime communication flight path planning method, device and system, belong to path planning technical field, method includes: grouping to the user scattered on sea surface, and form Delaunay triangle by grouped user;Determine the hovering point of unmanned aerial vehicle in each described Delaunay triangle;According to each described hovering point, the flight path of unmanned aerial vehicle is planned, the order that unmanned aerial vehicle visits each described hovering point is determined, and the shortest path is acquired;Based on the shortest path, the energy consumption of unmanned aerial vehicle in acceleration, deceleration and uniform speed stage is optimized, and the optimal path of unmanned aerial vehicle maritime communication is acquired.The method can acquire the shortest path and optimize the energy consumption of unmanned aerial vehicle in acceleration, deceleration and uniform speed stage, acquire the optimal path of unmanned aerial vehicle maritime communication.
Owner:HOHAI UNIV

A method for parallel generation of hexahedral mesh of assembly in fast reactor core based on block structure method

The application relates to the technical field of finite element mesh, and particularly discloses a hexahedral mesh parallel generation method for a fast reactor core assembly based on a block structure method, wherein Delaunay triangle partitioning is performed on the region of the same side of the wire winding, a Laplace equation is solved to generate an isopleth, and an orthogonal mesh is generated according to the isopleth to obtain a triangular surface mesh template of the same side of the wire winding; the fuel rod assembly is divided into six sections, each section is divided into a plurality of layers, the first section is taken as a base section, based on the triangular surface mesh template of the same side of the wire winding, block meshes are divided in each layer, quadrilateral surface meshes are generated in the block meshes, each layer surface mesh of other sections is obtained by rotating each layer surface mesh of the first section by a set angle, and the hexahedral mesh model is formed by connecting the layer surface meshes; the hexahedral mesh model is expanded; and the loop calling function is parallel optimized. The application solves the problems of incorrect generation of the hexahedral mesh of the fast reactor core assembly and low mesh division efficiency.
Owner:UNIV OF SCI & TECH BEIJING

Voronoi porous structure topology optimization method for advanced construction

The application is a Voronoi porous structure topology optimization method for advanced construction, which comprises the following steps: given an initial structure design space R and a structure stress condition, a user specifies the construction parameters of the Voronoi porous structure, including a preset volume fraction f, and sets the porous unit thin wall width t in combination with a manufacturing process; a relationship between the Delaunay triangle side length and the local volume fraction and the equivalent Young's modulus is established; the optimal equivalent Young's modulus is calculated according to the stress condition and the optimization target of the structure; the gradient Delaunay triangle is constructed according to the local volume fraction of the grid element; the vertices of all Delaunay triangles are extracted, the Voronoi polygon is generated and is given a width t, and the construction area is generated. The gradient Voronoi porous structure is generated by adopting the Delaunay triangle reconstruction, the Delaunay triangle side length is taken as a design variable, the Voronoi porous structure is constructed according to the optimal equivalent Young's modulus obtained by the maximum structure stiffness, and the optimization layout of the material is realized.
Owner:HOHAI UNIV

A method and system for multi-robot pursuit-evasion obstacle avoidance based on thiesen polygons

The application discloses a kind of method and system for multiple robots to avoid obstacles based on thiesen polygon, the method comprises: initialization limited space environment, obtain selected bounded region, selected bounded region is divided using thiesen polygon, distribute pursuit target and pursuit target point, using Delaunay triangle to region segmentation corrosion, obtain safe movement area, based on pursuit target point and safe movement area obtain pursuit obstacle avoidance direction control pointing point.The system includes: initialization module, thiesen polygon module, task allocation module, safe area division module, pursuit direction point module and escape direction point module.Through using the application, a series of problems caused by using reinforcement learning, estimation prediction and other methods can be avoided, and the robot's collision avoidance and pursuit direction selection under the condition of multiple obstacles can be realized with lower algorithm complexity.The application can be widely applied to the field of robot pursuit obstacle avoidance technology.
Owner:SUN YAT SEN UNIV +1