Triangulation algorithm for non-closed graph

A triangulation, non-closed technology, applied in computing, instrumentation, electrical and digital data processing, etc., can solve problems such as affecting graphics drawing and display, poor algorithm time complexity, reducing program execution efficiency, etc., to achieve good display effect, The effect of improving execution efficiency and high drawing accuracy

Inactive Publication Date: 2013-04-03
CHONGQING UNIV
View PDF2 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Although this improved algorithm can realize the subdivision of non-closed graphics, but because it needs to repeatedly judge and adjust the constraint boundary, it takes up a lot of memory and the time complexity of the algorithm is poor, which reduces the execution efficiency of the program and affects the graphics. drawing and display of

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
  • Triangulation algorithm for non-closed graph
  • Triangulation algorithm for non-closed graph
  • Triangulation algorithm for non-closed graph

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0023] figure 1 Introducing a virtual point set for the cavity interior, figure 2 For the triangulation produced by Algorithm 1, image 3 For the triangulation after the cavity is emptied, as shown in the figure: a kind of triangulation algorithm of non-closed figure provided by the present invention, comprises the following steps:

[0024] S1: At least one virtual point is introduced in the cavity domain of the non-closed figure; multiple virtual points can be set, two, three, four, etc., and the usage method provided by the present invention is adopted for multiple virtual points.

[0025] S2: Treat virtual points as ordinary scattered points to participate in triangulation; in order to ensure that the addition of virtual points only affects the triangulation inside the cavity domain during triangulation, the boundary between virtual points and the cavity should be kept preset distance. The distance between the virtual point and the boundary of the cavity can be determin...

Embodiment 2

[0028] The following details the specific process of realizing the triangulation of non-closed graphics:

[0029] In the present invention, three simple steps are used to realize the triangulation of the non-closed graphics in the image and output the processed image. Firstly, several virtual points are appropriately introduced into the cavity domain of the graph, and then the virtual points are regarded as ordinary scattered points to participate in Delaunay triangulation. After the division of all regions is completed, all triangles with the virtual points as vertices are finally deleted to complete Triangulation of open graphs.

[0030] Before introducing the algorithm, the definition of the corresponding point set is proposed first:

[0031] Definition 1: Suppose there are M discrete points on the plane domain, then define the plane point set P={} as the set of these M scattered points.

[0032] Definition 2: Assuming that N virtual scattered points are introduced in the...

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 discloses a triangulation algorithm for a non-closed graph. The triangulation algorithm for the non-closed graph comprises the following steps of: S1, introducing at least one virtual point into a cavity area of the non-closed graph; S2, participating in triangulation by regarding the virtual points as common scatters; and S3, deleting all triangles taking each virtual point as the vertex to form a cavity to realize the triangulation of the non-closed graph. Through adopting the method that the triangulation is performed after the proper virtual points are introduced into the cavity area of the non-closed graph, and then all triangles respectively taking the virtual points as the vertexes are deleted to form the cavity, the triangulation problem of the non-closed graph is effectively solved. Through introducing the virtual points into the cavity area, a traditional logical judgment idea is simplified, and the program execution efficiency and the graphic drawing precision are improved. The triangulation algorithm for the non-closed graph can be easily realized, and meanwhile, the triangulation algorithm is high in graphic drawing precision and can achieve a good display effect.

Description

technical field [0001] The invention belongs to the field of computer-aided design, in particular to a triangulation algorithm for non-closed graphics on a plane. Background technique [0002] Triangulation is an important topic in computer-aided design, and it has important applications in finite element analysis, information visualization and other fields. When simulating irregular and complex data fields generated by scientific computing and engineering analysis, triangulation meshes have stronger adaptability than rectangular meshes. [0003] Delaunay triangulation has the property that the smallest interior angle is the largest, which can avoid the appearance of ill-conditioned triangles as much as possible, effectively improve the approximation accuracy, and keep the overall quality of the grid optimal. As an important algorithm of Delaunay triangulation, the point-by-point interpolation method is simple in thinking and easy to program, and can effectively realize the...

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
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/50
Inventor 张杨邓兆祥阳小光周恺王婷婷李根李泉张枭
Owner CHONGQING UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap