A Method of Dividing Polygons with Arbitrary Dividing Lines

A technology of polygons and dividing lines, which is applied in the field of building two-dimensional graphics to divide regions and divide edges to divide polygons, so as to improve work efficiency, simplify the algorithm, and reduce the amount of post-calculation

Active Publication Date: 2020-12-04
广联达数字科技(广州)有限公司
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The existing technology provides a variety of polygon segmentation algorithms, such as the Weiler-Atherton algorithm, which uses one polygon to segment another polygon, that is, the cutting edge of this algorithm is a directed cutting edge connected end to end, and it is not applicable to any number of segments Cases where curves divide polygons

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
  • A Method of Dividing Polygons with Arbitrary Dividing Lines
  • A Method of Dividing Polygons with Arbitrary Dividing Lines
  • A Method of Dividing Polygons with Arbitrary Dividing Lines

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0054] The present invention will be described in further detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain the present invention, not to limit the present invention.

[0055] The present embodiment provides a method for dividing a polygon by an arbitrary dividing line, and the steps are as follows:

[0056] Step 1: Delete invalid cutting edge

[0057] Calculate the intersection of all split lines and the target polygon, delete those invalid cutting edges that coincide with the polygon or outside the polygon, make all the split lines actually participate in the split inside the polygon and mark the source of the intersection at the intersection.

[0058] Step 2: Extend the dividing line according to the rules

[0059] According to the extension rules, those dividing lines that need to be extended are extended into dividing lines that can divide the target p...

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 provides a method for segmenting a polygon by using any segmentation line, belongs to the technical field of computer geometric figures, and is used for segmenting areas in the field ofbuilding two-dimensional figures. According to the technical scheme, the method comprises the steps of deleting invalid segmentation lines, extending segmentation lines, preprocessing segmentation lines, calculating polygon boundaries and all minimum rings formed by all curve sets formed by the segmentation lines, deleting invalid rings in all result rings, outputting all segmented polygons and the like. By means of the scheme, the problem that any multiple different types of curves automatically extend according to rules and then rapidly segment any polygon is solved. the segmentation lines are automatically extended according to rules to carry out polygon segmentation, a user does not need to input a complete cutting line, the purpose of deleting invalid cutting edges and preserving intersection information of the valid cutting edges can be achieved only by carrying out line intersection once, and the later calculation amount of large-scale cutting is greatly reduced.

Description

technical field [0001] The invention belongs to the technical field of computer geometric graphics, and is used for dividing regions in the field of two-dimensional graphics of buildings. Specifically, it relates to a method for dividing a polygon by an arbitrary dividing line, in particular a method for dividing a polygon by using a dividing edge formed by a plurality of connected or non-connected two-dimensional curves of any type. Background technique [0002] The polygon segmentation problem is one of the fundamental problems in computer graphics. In the field of architectural design and architectural calculation, polygon segmentation is an important task, such as using arbitrary beams to divide floors, or using walls to divide a whole floor into individual rooms, etc. [0003] In the architectural design software, in order to improve the user's design efficiency and improve the friendliness of the design software, the user is allowed to input several complete or incomp...

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 Patents(China)
IPC IPC(8): G06T7/10G06T11/20
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