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

Polygon simplification method based on point deletion algorithm

A polygon and algorithm technology, applied in the field of polygon simplification based on point deletion algorithm, can solve the problems of complex calculation and slow speed, and achieve the effect of small calculation amount, retaining feature points, and polygon simplification.

Inactive Publication Date: 2019-05-21
HOHAI UNIV CHANGZHOU
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, this method is not only relatively complex to calculate, but also relatively slow, and it is impossible to know which vertices are deleted to have the least impact on the graph while achieving the simplification effect

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
  • Polygon simplification method based on point deletion algorithm
  • Polygon simplification method based on point deletion algorithm
  • Polygon simplification method based on point deletion algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0024] The present invention will be further described below in conjunction with the accompanying drawings.

[0025] Such as figure 1 As shown, a polygon simplification method based on the point deletion algorithm includes the following steps:

[0026] Step 1. Arrange all the vertices of the polygon into a vertex queue P according to the adjacent relationship 1 (x 1 , Y 1 ), P 2 (x 2 ,y 2 ), P 3 (x 3 ,y 3 )…P n (x n ,y n )(n>3), the mth vertex P in the two-dimensional polygon m The angle formed by the two adjacent sides is called the vertex angle m (0m m . Calculate the vertex angle and vertex area corresponding to each vertex. calculate area m and angle m The values ​​are as follows:

[0027] area m =|((x m -x m-1 )*(y m+1 -y m-1 )-(y m -y m-1 )*(x m+1 -x m-1 )) / 2|

[0028]

[0029] the angle m =cos -1 (cos(angle m ))

[0030] The vertex angle and vertex area of ​​each vertex can be calculated according to the above formula.

[0031] Step 2...

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 polygon simplification method based on a point deletion algorithm. The method comprises the following steps: step A1, calculating a vertex included angle and a vertex area corresponding to each vertex; step A2, substituting the calculated vertex included angle and vertex area into an objective function to obtain objective function values with different sizes; step A3, deleting the vertex with the maximum objective function value, and calculating new objective function values of the previous vertex and the next vertex of the deleted point; and step A4, judging whetherthe deleted polygon vertex number is equal to the vertex threshold number A or not, and if not, repeating the step A3 until the deleted polygon vertex number is equal to the vertex threshold number A.According to the method, the vertexes with the maximum objective function values are deleted by calculating different objective function values corresponding to different vertexes, so that the purpose of polygon simplification is achieved; The method provided by the invention not only is small in calculation amount, but also can perform multiple times of calculation, and can retain the feature points of the polygon to the maximum extent.

Description

technical field [0001] The invention relates to the related field of computer graphics, in particular to a polygon simplification method based on a point deletion algorithm. Background technique [0002] In the field of engineering, graphics are often processed, especially polygons. In the actual production process, the complexity of the polygon often has a certain impact on the project. Therefore, for the needs of the project, it is usually necessary to simplify the polygon. At present, polygon simplification mainly achieves the effect of simplification by comparing the area of ​​the polygon after deleting the vertices with the area of ​​the original polygon. However, this method is not only relatively complex to calculate, but also relatively slow, and it is impossible to know which vertices are deleted to have the least impact on the graph while achieving the simplification effect. Contents of the invention [0003] In order to solve the above problems, the present in...

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 HOHAI UNIV CHANGZHOU
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