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

Parallel construction method limiting Delaunay triangulation network

A construction method and technology of triangular network, applied in the direction of drawing from basic elements, etc., can solve problems such as single-machine multi-core research needs to be strengthened.

Inactive Publication Date: 2017-03-08
SOUTHWEST UNIVERSITY
View PDF4 Cites 10 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the existing parallelism rarely involves the parallel division of data, and mainly focuses on the distributed parallel environment of the cluster, and the research on single-machine multi-core needs to be strengthened

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
  • Parallel construction method limiting Delaunay triangulation network
  • Parallel construction method limiting Delaunay triangulation network
  • Parallel construction method limiting Delaunay triangulation network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0025] The present invention has designed the related algorithm of constraint Delaunay triangulation construction, selects the point-by-point insertion method to construct Delaunay triangulation, wherein the convex hull construction adopts the Graham scanning method to have better execution efficiency relative to the volume wrapping method, and the embedding constraint adopts segmented polygons The method avoids the possible infinite loop in the edge exchange algorithm, and parallelizes the non-co-influence domain part of the embedding constraint in parallel computing, which greatly shortens the time of embedding constraints. figure 1 It is the algorithm flow of the present invention. The specific implementation of the parallel construction of the constrained Delaunay triangular network of the present invention will be described in detail below with reference to the figures.

[0026] Step 1: Define the data structure of the main object.

[0027] Step 1-1: Point Object

[002...

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 parallel construction method limiting a Delaunay triangulation network. Work in aspects including construction of the Delaunay triangulation network, embedding of constraint conditions and parallel calculation of constraint embedding is carried out. The Delaunay triangulation network is constructed via a pointwise insertion method, construction of a convex hull uses a Graham scanning method, constraint embedding uses a method in which a polygon is subdivided into parts, a possible endless loop of an edge switching algorithm is avoided, a constraint embedded non-common influence domain is parallelized in parallel calculating, and time of constraint embedding is shortened greatly. Parallel programming needs to be combined with practical conditions to realize parallel calculating in serial codes which are large in data bulk and operand and can be parallelized, the system cost for developing multiple threads is much lower than benefit from improvement of parallel calculating due to proper task decomposition, effective data conflict processing and correct selection of parallel strategies, and advantages of parallel calculating are made obvious.

Description

technical field [0001] The invention discloses a parallel construction method of the constrained Delaunay triangular network, which can realize the rapid construction of the constrained Delaunay triangular network. Background technique [0002] The triangulation of plane discrete points is not a very new topic, but the true 3D technology is immature, and at the same time, any scattered points on the 2D plane can be well established with attribute data to establish a ground digital model, so that the discrete point domain on the plane The triangulation of GIS is still widely used in the fields of geographic information system GIS geoscience analysis, surface object reconstruction, finite element analysis, highway CAD technology and so on. According to the data distribution characteristics of the scatter domain, its triangulation can be divided into unconstrained triangulation and constrained triangulation. In practical applications, there are often constraints between some s...

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
IPC IPC(8): G06T11/20
CPCG06T11/20
Inventor 沈敬伟汪宇周廷刚
Owner SOUTHWEST UNIVERSITY
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