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

Method of resolving shortest distance between any two polyhedrons in three-dimensional space

A shortest distance, three-dimensional space technology, applied in the field of solving the shortest distance between polyhedrons, to achieve the effect of high accuracy, speeding up the solution speed, and shortening the calculation time

Active Publication Date: 2018-11-23
UNIV OF SHANGHAI FOR SCI & TECH
View PDF2 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0009] To sum up, most of the current research only solves the calculation of the shortest distance between convex polyhedrons and concave polyhedrons independently.

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 of resolving shortest distance between any two polyhedrons in three-dimensional space
  • Method of resolving shortest distance between any two polyhedrons in three-dimensional space
  • Method of resolving shortest distance between any two polyhedrons in three-dimensional space

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0028] In order to make the technical means, creative features, goals and effects of the present invention easy to understand, the following embodiments will specifically explain the method of the present invention for calculating the shortest distance between any two polyhedrons in three-dimensional space in conjunction with the accompanying drawings.

[0029] figure 1 is a schematic diagram of the process of the method for solving the shortest distance between any two polyhedrons in the three-dimensional space in the embodiment of the present invention.

[0030] Such as figure 1 As shown, the method for solving the shortest distance between any two polyhedrons in the three-dimensional space in this embodiment includes the following steps:

[0031] Step S1, the polyhedron M x and the polyhedron M y The surface of the 3D model is triangulated and preprocessed to obtain processing information.

[0032] Polyhedron M x Is a concave or convex body, in this embodiment, the pol...

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 of resolving a shortest distance between any two polyhedrons in a three-dimensional space. The method is characterized by comprising the following steps of first, rasterizing surface triangles of three-dimensional models of a polyhedron Mx and a polyhedron My and pre-processing so as to obtain processing information; second, processing the processing information byusing a back-culling algorithm so as to obtain a vertex selection area, wherein the vertex selection area comprises multiple text vertex pairs consisting of vertexes of the polyhedron Mx and the polyhedron My; third, resolving a shortest distance between two vertexes of a text vertex pair in the vertex selection area by using both gene expression programming and an Alopex algorithm so as to obtaina closes vertex pair, wherein the distance between the closest vertex pair is an approximate solution of shortest distance between the polyhedron Mx and the polyhedron My; and fourth, resolving an accurate shortest distance between the polyhedron Mx and the polyhedron My by using the closest vertex pair so as to obtain a shortest distance. The method can obtain highly accurate solution and has high convergence performance.

Description

technical field [0001] The invention relates to a method for solving the shortest distance between polyhedrons, in particular to a method for solving the shortest distance between any two polyhedrons in a three-dimensional space. Background technique [0002] Finding the shortest distance between two objects can be widely used in robotics, physical system simulation, virtual experience, CAD / CAM, computer animation and other fields. The distance information is used in robot path planning to determine the distance of obstacles so that the robot can effectively avoid obstacles; in physical system simulation and virtual experience, it is used to calculate the size of contact force and penalty function evaluation; in computer animation, It is used for accurate collision detection and physical simulation; it is used for interference processing in CAD / CAM and NC machining simulation. Specifically, the virtual maintenance simulation process of equipment needs the support of this te...

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): G06N3/12G06T19/00G06Q10/00
CPCG06N3/126G06Q10/20G06T19/00
Inventor 王文举窦曙光姜中敏
Owner UNIV OF SHANGHAI FOR SCI & 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