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

A Boundary One-stroke Method for Dealing with Multi-Containment Relations of Polygons

A polygonal and relational technology, applied in the field of border organization of complex polygons, can solve problems such as layered capping and data redundancy, and achieve the effect of ensuring correctness and avoiding complexity and redundancy

Inactive Publication Date: 2017-12-08
HUBEI UNIV OF TECH
View PDF3 Cites 0 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 of data redundancy caused by a unified object having to be split into multiple objects when the polygons with multiple inclusion relationships are organized, and also avoid the layering in computer reality Gland problem

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 Boundary One-stroke Method for Dealing with Multi-Containment Relations of Polygons
  • A Boundary One-stroke Method for Dealing with Multi-Containment Relations of Polygons
  • A Boundary One-stroke Method for Dealing with Multi-Containment Relations of Polygons

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0032] In order to make it easier for those skilled in the art to understand and implement the present invention, the present invention will be further described in detail below in conjunction with the accompanying drawings and specific embodiments.

[0033] Such as figure 1 As shown, it is a schematic flow chart of the present invention. Through five steps, the polygon of the target object in a certain area is judged by the plane geometric coordinates and specific target attributes to determine the multiple inclusion relationship of the polygon of the target polygon. And find the shortest connecting line according to the definition and principle of the shortest connecting line, iteratively carry out the boundary organization of the two-layer containment relationship from the inside to the outside, until all the effective boundaries of the target polygons are connected and organized in one stroke, so as to solve the problem of polygons with multiple containment relationships. ...

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 present invention proposes a one-stroke border method for dealing with multiple inclusion relationships of polygons. The present invention introduces a one-stroke border method based on the shortest connection line, which effectively solves the problem of reasonable border connections and complex polygons under the premise of maintaining the consistency of topology. The problem of organization avoids the complexity and redundancy of data, and effectively ensures the correctness of map layered display.

Description

technical field [0001] The invention relates to a boundary organization method of complex polygons with containment relationship in a vector map, in particular to a one-stroke boundary organization method for merging polygons with target attributes. Background technique [0002] In the vector map, there are complex polygons with multiple inclusion relationships, and there are mainly three ways of organization and reality. The first is to sort each element of the complex polygon into different levels, and then process it sequentially by a computer program. The second method is to divide the complex polygon into multiple original triangles, meshes or simple polygons, then check whether each original element is visible, and finally draw the visible elements. The third approach uses 3D models and translucency techniques to delineate individual parts of complex polygons. [0003] There are some defects in the above three methods. The first method ignores the integrity of the 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 Patents(China)
IPC IPC(8): G06T11/20
Inventor 龚红波钮焱
Owner HUBEI UNIV OF 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