Unlock instant, AI-driven research and patent intelligence for your innovation.

Method for extracting minimum closed graphs

A closed figure, the smallest technology, applied in the direction of drawing from basic elements, special data processing applications, instruments, etc., can solve the problems of low efficiency and long time required for the minimum closed figure, and achieve the effect of rapid extraction and high efficiency

Active Publication Date: 2013-05-22
SHENZHEN LAN YOU TECH
View PDF1 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The technical problem to be solved by the present invention is to provide a method for calculating any intersecting straight line segments to extract all minimum closed figures that do not cover each other, aiming at the defects of low efficiency and long time for extracting minimum closed figures in the prior art

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 extracting minimum closed graphs
  • Method for extracting minimum closed graphs
  • Method for extracting minimum closed graphs

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0035] In order to make the purpose, technical solutions and advantages of the present invention clearer, the various embodiments to be described below will refer to the corresponding drawings, and these drawings constitute a part of the embodiments, which describe various possible implementations of the present invention. kind of embodiment. It is to be understood that other embodiments may be utilized or structural and functional modifications may be made to the embodiments set forth herein without departing from the scope and spirit of the present invention.

[0036] The first embodiment of the method for extracting the smallest closed figure in the present invention, such as figure 2 shown, including:

[0037] S1. Establish an intersection information table;

[0038] S2. According to the intersection point information table, determine the intersection points constituting the closed figure;

[0039] S3, judging one by one whether there is a closed figure including all t...

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 extracting minimum closed graphs. The method includes: S1, establishing an intersection point information table; S2, determining the intersection points constituting the closed graphs according to the intersection point information table; S3, judging one by one whether the closed graphs containing all the intersection points exist in multiple determined closed graphs or not, if so, then deleting all the closed graphs; S4, saving the previous step as a final result. By the method for extracting the minimum closed graphs, the minimum closed graphs can be extracted rapidly, even in case of the intersection points being in large quantities, the minimum closed graphs not overlaying one another can be rapidly extracted, and the method is high in efficiency.

Description

technical field [0001] The invention relates to the technical field of graphics processing, in particular to a method for calculating any intersecting straight line segments and extracting all non-overlapping minimum closed graphics. Background technique [0002] When developing a CAD graphics platform, it is necessary to cut out the smallest closed graphics that do not cover each other for the lines drawn by the user. [0003] Existing methods for extracting all non-overlapping closed graph algorithms from arbitrary intersecting straight line segments, such as figure 1 As shown, generally, all the lines are traversed, all closed figures are extracted, the extracted closed figures are covered and judged, and the mutually overlapping figures are filtered to obtain all the minimum unit closed figures that do not cover each other. When the lines are complex and the number of intersection points is large, the efficiency of extracting closed graphics is low and it takes a long t...

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/20G06F17/50
Inventor 李嘉
Owner SHENZHEN LAN YOU TECH