Discrete point representation-based two-dimensional scalar field interpolation method and device and computer equipment
An interpolation method and scalar field technology, applied in the field of simulation, can solve the problems of low interpolation accuracy and efficiency, achieve good interpolation accuracy, improve the accuracy of interpolation, and solve the effect of interpolation problems
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment approach 1
[0069] Embodiment 1. A two-dimensional scalar field interpolation method based on discrete point representation, characterized in that the method includes:
[0070] Step 1. Obtain the discretely distributed scalar field and the coordinate position of the point to be interpolated;
[0071] Step 2. Triangulate the discretely distributed scalar field, and divide the two-dimensional plane into several triangular units;
[0072] Step 3. Calculate the center position of each of the triangular units, and obtain the center points of all the triangular units;
[0073] Step 4, according to the center points of all the triangular elements, obtain the triangular element where the point to be interpolated is located;
[0074] Step 5: Perform linear interpolation in the triangle unit where the point to be interpolated is located to obtain the attribute value of the point to be interpolated.
[0075] This embodiment proposes an interpolation method for a two-dimensional scalar field. The t...
Embodiment approach 2
[0076] Embodiment 2, this embodiment is a further limitation of the two-dimensional scalar field interpolation method based on discrete point representation described in Embodiment 1. In this embodiment, the previous step of step 3 is further restrictions, including:
[0077] The center points of all the triangular units are combined in the form of KD-Tree.
[0078] In this embodiment, KD-Tree is a data structure expression of computer graphics, which is realized based on the basic data structure of trees and graphs, and can realize fast search and comparison of spatial points.
Embodiment approach 3
[0079] Embodiment 3, this embodiment is a further limitation of the two-dimensional scalar field interpolation method based on discrete point representation described in Embodiment 2. In this embodiment, the step 4 is further limited, which specifically includes: :
[0080] Using KD-Tree and a three-dimensional space algorithm, the triangular unit where the point to be interpolated is located is obtained.
[0081] This implementation utilizes the advantages of KD-Tree for quick search and comparison. In the space where the point to be interpolated is located, according to a certain algorithm, the triangle unit where the point to be interpolated can be quickly found, avoiding global traversal and retrieval. The calculation efficiency is relatively high, thereby improving the efficiency of the interpolation method.
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com



