Method for filling concave polygon based on triangulation algorithm

A technology of concave polygons and triangulation, applied in the field of graphics, can solve problems such as inability to fill concave polygons

Active Publication Date: 2021-06-22
西安葛兰创智信息科技有限公司
View PDF4 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The purpose of the present invention is to solve the problem that the traditional triangulation algorithm cannot fill the concave polygon in the process of filling the three-dimensional graphics, and to provide a method based on the triangulation algorithm to fill the concave polygon. The method of polygon filling processing

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
  • Method for filling concave polygon based on triangulation algorithm
  • Method for filling concave polygon based on triangulation algorithm
  • Method for filling concave polygon based on triangulation algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0050] see image 3 , image 3It is the structural diagram of the target concave polygon of the embodiment. First, the target concave polygon is processed based on the Delaunay triangulation algorithm, and it is filled into a convex polygon. Then according to the triangulation algorithm, the intersection points of each line segment of the triangle and the boundary of the convex polygon are obtained, and finally the polygon is re-triangulated based on the intersection point and the vertices of the original concave polygon.

[0051] see Figure 4 , Figure 4 For the discrimination result of the triangle in the embodiment, first, take the starting point of the target concave polygon as the initial point, and calculate the normal vectors of each triangle in sequence according to the order of parameter values ​​from small to large, such as △ 123 , △ 234 , △ 245 , and compared with the normal vector direction of the target concave polygon, Figure 4 The direction of the normal...

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 method for filling a concave polygon based on a triangulation algorithm, and belongs to the field of graphics. According to the method for filling the concave polygon based on the triangulation algorithm, triangulation is carried out on the concave polygon through the triangulation algorithm, meanwhile, a convex polygon is formed, then, intersection points of all side line segments of the triangle obtained through the triangulation algorithm and the boundary of the target concave polygon are calculated, the intersection points are parameterized, and the convex polygon is formed. Taking the intersection point and the intersection point of the original polygon as the basis, carrying out triangularization again to obtain a new triangularized polygon, taking the parameterization initialization point of the original polygon as the starting point, calculating the normal vector of each triangle according to the sequence of parameterization values from small to large, and determining the leaving of the triangle through the comparison between the normal vector direction of the triangle and the normal vector direction of the original polygon. And finally, the effect of filling the target concave polygon is achieved.

Description

technical field [0001] The invention belongs to the field of graphics, and relates to a method for filling and processing concave polygons based on a triangulation algorithm. Background technique [0002] In recent years, with the rapid development of BIM technology, 3D visualization of architectural models has become one of the important directions of the construction industry. Among them, model filling is one of the problems often encountered in the field of graphics, and it is also one of the application directions in the field of model visualization. In order to distinguish the structural characteristics of the model, it is often necessary to fill different components of the model with different colors. [0003] In order to draw 3D graphics in a 3D engine, the geometry of the object is usually reconstructed and filled with triangular surface data. For irregular objects, the triangulation algorithm is often used when triangulating the surface data. The triangulation algor...

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): G06T11/20
CPCG06T11/203
Inventor 赵少飞董建强吕建让
Owner 西安葛兰创智信息科技有限公司
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