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

Method for performing triangularization on polygon containing holes and islands in two-dimensional plane

A two-dimensional plane and polygonal technology, applied in 2D image generation, image data processing, instruments, etc., can solve the problems of triangulation of polygons with holes, complex algorithms, and difficult computer program logic implementation.

Inactive Publication Date: 2012-09-12
SHANGHAI JUTANG INFORMATION TECH
View PDF0 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0008] The purpose of the present invention is: solve the technical difficult problem that exists in the prior art, promptly solve the algorithm complex that exists in the processing process of polygon triangulation in the past, be not easy to the realization of computer program logic etc. Unsolvable triangulation of polygons with holes

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

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0024] The present invention is described in detail according to specific embodiments below:

[0025] A method for triangulating a polygon containing holes and islands in a two-dimensional plane, comprising the following steps:

[0026] (1) Obtain the original data, abstract the original data, and store it as a set of vertices and edges of polygons and a set of vertices and edges of holes. Whether the set of edges constitutes a hole or a polygon is specified by the data input side. The logical storage format of the data is not limited, but the original data input by the user should contain the following content after abstract expression:

[0027] Vertex coordinates: defined by coordinate values ​​(X,Y) in the xOy plane.

[0028] Vertex index number: each vertex is assigned an index number, multiple vertices with the same coordinates are treated as one vertex, and only one index number is assigned to avoid data redundancy.

[0029] Edge composition: An edge is formed by 2 ve...

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 relates to a method for polygon triangularization processing performed by a computer, and solves the problems that the algorithm is complex and computer program logic is not easy to realize during the process of polygon triangularization processing. The method is characterized by comprising the following steps: a, extracting a vertex and sides of polygon containing holes and islands in a two-dimensional plane, removing redundancy, and building a set of the sides and the vertex; b, recombining to form a new independent polygon set and hole set; c, establishing the relation between the polygon and the holes; d, cutting each independent polygon containing holes into a triangular chord set; e, combining sides and the chord of each independent polygon containing holes into a candidate triangle set; and f, screening and removing repeated and unreasonable triangles in the candidate triangle set, so as to form an effective triangular facet data set.

Description

technical field [0001] The invention relates to a method for computer processing polygon triangulation, in particular to a method for triangulation of polygons with holes. Background technique [0002] The triangulation of a plane polygon is to add no new vertices to the existing polygon, but only add a dividing line (or called a chord), so that the plane polygon is divided into a series of non-overlapping triangles. Triangle is the basic primitive of various 3D graphics program development interfaces (such as DirectX, OpenGL, OpenSceneGraph) in computer graphics at present. Ordinary irregular 2D polygon information cannot be directly used by these development interfaces, and must be subdivided into components that can form The triangle collection of the polygon is submitted to the corresponding development interface function in the form of the triangle collection information, so that the polygon can be processed or displayed normally. [0003] Two-dimensional polygons are ...

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/00
Inventor 陆宗靖
Owner SHANGHAI JUTANG INFORMATION 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