Abstract
In this study, the data processing method of a large-scale isoface is used to reduce the storage space of internal memory, improve data structure, and achieve predictability. The design of an algorithm mainly includes the following tasks: increasing the operation speed by improving the parallel granular of the GPU, finishing the segmentation of the adaptive tetrahedral octree, calculating the dual points through the quadric error function in four-dimensional space, searching for the minimum edge as well as finishing the data structure of the edge and the design of the octree node, and proposing that the algorithm be constantly performed until all levels of the minimum edge are found. The result of the algorithm design for the large-scale data is that the speed of parallel algorithms improves and the effect becomes more obvious. Research on large-scale data access high-speed ratio and structure improvement have experimental and theoretical reference value.
Highlights
The mode of computer storage and data organization is called data structure
The design of an algorithm mainly includes the following tasks: increasing the operation speed by improving the parallel granular of the GPU, finishing the segmentation of the adaptive tetrahedral octree, calculating the dual points through the quadric error function in four-dimensional space, searching for the minimum edge as well as finishing the data structure of the edge and the design of the octree node, and proposing that the algorithm be constantly performed until all levels of the minimum edge are found
Data structure refers to a set of one or more relationships between data elements
Summary
Kok-Lim proposed a mesh resampling method that deals with any form of grid data. Most adaptive isoface algorithms are not guaranteed to produce a mesh manifold To solve this problem, we propose a sorting method that simplifies and reduces the error produced by the volume data function. MATEC Web of Conferences original volume data and cannot be divided This quadtree has 25 child nodes, the first layer has 1, the second layer has 8, and the third layer has 16. Where nodes intersect at different layers of volume data, the edge of the node of the high layer adjacent to the lower nodes is split, so that higher-layer nodes no longer take a quadrilateral form. In the figure, this node becomes a polyhedron and a portion of the face becomes a polygon. The triangle is obtained from the dividing face connected with this dual point
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
