Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Texture mapping method based on triangular mesh simplification

A technology of triangular mesh and texture mapping, which is applied in the field of image processing and can solve problems such as low time performance

Inactive Publication Date: 2015-06-03
XIAN UNIV OF SCI & TECH
View PDF5 Cites 25 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] The purpose of the present invention is to overcome the problem that the existing texture mapping method for the curved surface represented by the triangular mesh needs to find out the texture coordinates of each triangular mesh vertex, so that the time performance is low

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Texture mapping method based on triangular mesh simplification
  • Texture mapping method based on triangular mesh simplification
  • Texture mapping method based on triangular mesh simplification

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0059] A texture mapping method based on triangular mesh simplification, comprising the steps of:

[0060] Step 1, simplifying the triangular network model, thereby obtaining the simplified triangular network model;

[0061] Step 2, using the simplified triangular network model obtained in step 1 to establish a spring-mass model, and obtain the final position of the simplified triangular grid parameterized in the rectangular domain through the spring-mass model;

[0062] Step 3, using the process of obtaining the simplified triangular network model, calculate the initial position of the deleted point in the parameterized rectangular domain, so as to obtain the positions of all vertices in the initial model in the parameterized rectangular domain;

[0063] Step 4. Establish a spring-mass model for the parameterized initial model, fix its boundary vertices, trigger interior point iterations, until the position of the interior point reaches equilibrium, and obtain the parametric ...

Embodiment 2

[0101]Triangular Mesh Simplification

[0102] The above method first traverses all triangular meshes to obtain the boundary points of the meshes. Then assign a folding cost to all directed edges in the triangular mesh according to a certain criterion, and after obtaining the directed edge with the smallest folding cost, check whether the starting point of the directed edge is the boundary point of the grid, and then find a method to include The folding of the boundary points is specially treated; if there are no boundary points, the edge with the smallest cost is folded and deleted. Repeat the above steps continuously until the number of mesh vertices meets the simplification requirements. Here, the most critical issue is how to define the directed edge folding cost. In addition, the processing method of directed edges containing boundary points also directly affects the model simplification effect.

[0103] Directed edge folding cost metric

[0104] First, assign a weight...

Embodiment 3

[0116] Parameterization based on spring-mass model

[0117] Since the initial data of the triangular mesh model is only the three-dimensional coordinates of each vertex and the vertex numbers of the triangles, it is necessary to preprocess the initial triangular mesh data to obtain data information that can be used more directly.

[0118] First, it traverses the vertices of the triangles, finds the number n of vertices, initializes an n×n matrix, and then traverses all the triangle vertex sequences of the triangular mesh model in turn. While traversing, change the initialization matrix. For example, a triangle vertex sequence (a, b, c), then add 1 to the value of column b and c of row a in the matrix, add 1 to the value of column b of row b, and add 1 to the value of column a and b of row c value plus 1. After the traversal, the vertex relationship matrix is ​​obtained.

[0119] This vertex relationship matrix is ​​a symmetric matrix, and each row of the matrix is ​​travers...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention belongs to the technical field of image processing and particularly relates to a texture mapping method based on triangular mesh simplification. The texture mapping method comprises the following steps: simplifying a triangular network model and establishing a spring-mass-point model; parameterizing the spring-mass-point model to a final position of a rectangular region; by utilizing a process of simplifying the triangular network model, calculating an initial position of a deleted point in the parameterized rectangular region to obtain positions of all vertexes of an initial model in the parameterized rectangular region; parameterizing the initial model to establish the spring-mass-point model; fixing the boundary vertex and triggering inner point iteration until the position of an inner point is balanced to obtain a spring-mass-point model revised parameterized coordinate; and carrying out normalization processing to obtain a texture coordinate of a grid vertex, and carrying out texture mapping. According to the method, the texture coordinate of each triangular network grid vertex does not need to be solved and texture mapping can be directly carried out; the time complexity of the method can be reduced to the great extent and the time performance is improved.

Description

technical field [0001] The invention belongs to the technical field of image processing, and in particular relates to a texture mapping method based on triangular grid simplification. Background technique [0002] With the rapid development of 3D scanning hardware and the improvement of 3D modeling level, the fineness of 3D models is getting higher and higher. At the same time, the data volume of the models has become very large. On the one hand, it is difficult to meet the needs of real-time transmission and processing of the model, and on the other hand, it also has a great impact on the rendering efficiency of the scene. Therefore, the model must be simplified in these applications. [0003] In various fields of our life, there are more and more demands for texture mapping on irregular surfaces. For example, in industrial modeling, free-form surfaces are often used to design the shape of airplanes, ships, and automobiles. In laser marking machines, it is necessary to per...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06T15/04G06T17/00
Inventor 李占利刘小靖
Owner XIAN UNIV OF SCI & TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com