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

A Fast Visualization Method for Massive Arbitrarily Shaped Polygons

A technology of arbitrary shape and polygon, applied in the direction of instrumentation, computing, image data processing, etc., can solve the problems of low algorithm efficiency, slow processing and visualization speed, etc., and achieve the effect of speed improvement and visualization parallelism

Active Publication Date: 2016-09-21
北京微视威信息科技有限公司
View PDF2 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] Regardless of the above-mentioned various subdivision algorithms that perform additional processing on concave polygons, or the meshing framework provided by OpenGL, when faced with large-scale or even massive arbitrary polygons, they all face the problems of low algorithm efficiency, slow processing and visualization speed. Serious 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 Fast Visualization Method for Massive Arbitrarily Shaped Polygons
  • A Fast Visualization Method for Massive Arbitrarily Shaped Polygons
  • A Fast Visualization Method for Massive Arbitrarily Shaped Polygons

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0040] The present invention will be described in detail below through specific embodiments and accompanying drawings.

[0041] Basic definition:

[0042] Polygon (Polygon), its geometric model is expressed as:

[0043] 1) A circular linked list represents the outer boundary of a polygon, which is a closed sequence composed of the sides of the polygon in a certain direction, and a polygon can only have one ring chain;

[0044] 2) A ring represents a hole in a polygon, a strictly defined polygon contains 0 or a limited number of rings, and rings can contain rings;

[0045] 3) The intersection of adjacent line segment pairs is a single point (vertex) shared between them, and non-adjacent line segment pairs do not intersect (that is, they cannot self-intersect).

[0046] Concave Polygon: A polygon with at least one Reflexive Angle. Extend any side of a non-self-intersecting polygon to form a straight line infinitely. If only one side of the polygon extends infinitely to both s...

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 rapidly visualizing mass polygons of any shapes. The method comprises the following steps: locally laminating a polygon input sequence according to the visualizing sequence and shielding relation of the polygons in a way of taking each layer as one group, and arranging the drawing sequence of each group from a bottom layer to a top layer under the condition of avoiding conflict among the grouped drawing sequences to obtain a non-conflict grouping groove; taking one group of non-conflict polygons of any shapes out of the non-conflict grouping groove, performing twice drawing with counting and filling meanings after triangular sectioning, and repeating the abovementioned processes for certain times to obtain a finial visualization result. By adopting the method, the visualizing parallelism degree of the mass polygons of any shapes can be increased, and the speed can be increased by over two times compared with the conventional ArcGIS and Mapnik geographic information visualizing engine.

Description

technical field [0001] The invention belongs to the technical fields of computer graphics, geographic information technology, visualization, etc., and relates to a fast visualization method for massive polygons with arbitrary shapes on a GPU. Background technique [0002] In graphics and GIS applications, it is common to process and visualize a large number of curved edges, complex polygons with many holes. For the simplest form of convex polygons without holes, existing graphics standard APIs (such as OpenGL or DirectX) provide direct drawing / visualization methods. However, for other complex forms, especially the form of concave polygons and polygons with holes, existing standard graphics APIs do not provide direct support, and often require a lot of extra calculation and processing work. The commonly used strategy is to perform Delaunay (Delaunay) subdivision processing on concave polygons from the perspective of computational geometry (Song Xiaomei; Zhang Xiaodong; Li Ji...

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): G06T1/00
Inventor 李胜徐泽骅汪国平
Owner 北京微视威信息科技有限公司
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