Supercharge Your Innovation With Domain-Expert AI Agents!

Convex polygon collision detection method

A technology of convex polygons and detection methods, applied in sports accessories, indoor games, video games, etc., can solve the problems of large computing resources and consumption

Active Publication Date: 2021-09-14
GUANGDONG UNIV OF TECH
View PDF0 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] The present invention provides a detection method for convex polygon collisions, which solves the problem that currently exists in the game due to the time-consuming global collision detection of multiple dynamic objects. Technical issues with larger amounts of computing resources

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
  • Convex polygon collision detection method
  • Convex polygon collision detection method
  • Convex polygon collision detection method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0062] Example 1, please refer to figure 1 , figure 1 It is a flow chart of Embodiment 1 of a detection method for convex polygon collision of the present invention, including:

[0063] Step S101, according to the acquired centroid coordinate data of the two convex polygons and the relationship between the polygon edge normal and the centroid line vector, calculate the set of support points and potential separation axes of the two convex polygons;

[0064] Step S102, using the hill-climbing method to calculate the set of support points and potential separation axes of the convex polygon, to obtain the projected overlapping length of the two convex polygons;

[0065] Step S103, comparing the size relationship of the projected overlapping lengths to obtain the minimum moving distance;

[0066] Step S104, according to whether the value of the minimum moving distance is a positive value, determine whether the two convex polygons collide.

[0067] In the method for detecting col...

Embodiment 2

[0068] Example 2, please refer to figure 2 , figure 2 It is a flow chart of a detection method for a convex polygon collision of the present invention, including:

[0069] Step S201, based on the obtained centroid coordinate data of the two convex polygons, combined with the relationship between the polygon edge normal and the centroid line vector, calculate and obtain the collidable vertex sequence of the two convex polygons;

[0070] It should be noted that the order of the vertices of the convex polygon is arranged clockwise, and the normals point to the left side of the direction of the edge vector

[0071] In the embodiment of the present invention, the centroid coordinate data of two convex polygons are obtained first, and then the possible coordinates of the two convex polygons are calculated according to the centroid data and the relationship between the polygon side normal and the centroid line vector. Sequence of colliding vertices.

[0072] In specific implemen...

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 convex polygon collision detection method. The method comprises the following steps: performing calculating to obtain support points and potential separation axis sets of two convex polygons according to obtained centroid coordinate data of the two convex polygons and a relationship between a polygon edge normal and a centroid connecting line vector, calculating the support points and the potential separation axis sets of the convex polygons through a hill climbing method to obtain the projection overlapping lengths of the two convex polygons, comparing the size relation of the projection overlapping lengths to obtain a minimum movement distance, judging whether the value of the minimum movement distance is a positive value or not, and determining whether the two convex polygons collide or not. According to the convex polygon collision detection method provided by the invention, collision detection can be quickly and accurately carried out on convex polygons.

Description

technical field [0001] The invention relates to the field of convex polygon collision detection, in particular to a detection method for convex polygon collision. Background technique [0002] In the field of video games, in order to achieve enough reality and conform to the logic of the real world, it is a very common requirement to correctly represent the effect of two objects touching or colliding with each other, which can give players a more realistic gaming experience. In the game scenes generated by computer software, objects are usually represented by abstract geometric models (such as vertex arrays or implicit functions), these geometric models do not have physical properties of the real world, so when relative motion occurs, it is possible The phenomenon of mutual penetration occurs because there is no "collision" behavior that occurs in the real world, resulting in inconsistency with the real world scene. Therefore, in order to simulate the collision of objects i...

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): A63F13/57A63F13/52
CPCA63F13/57A63F13/52
Inventor 苏庆黎智洲黄剑锋
Owner GUANGDONG UNIV OF TECH
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com