Collision detection optimization method based on curvature point clustering and decision tree

Abstract

The invention discloses a collision detection optimization method based on curvature point clustering and a decision tree. The method includes the following steps that: step 1, a hierarchical boundingbox is selected based on curvature point clustering and geometric features; and step 2, the establishment of a hybrid hierarchical tree is optimized based on a decision tree model. According to the method, the curvatures of the contour points of different types of collision objects are calculated, the geometric features of the contour points of the collision objects are analyzed; a K-means clustering algorithm is used to select the appropriate bounding box, so that the degree of matching between the bounding box and the collision objects can be improved; and a Boosting algorithm is used to improve the accuracy of the decision tree model, redundant calculation in an original collision detection algorithm is omitted, the establishment process of the hybrid hierarchical tree is optimized, and therefore, the efficiency of collision detection can be improved.

Description

technical field [0001] The invention belongs to the research field of computer vision and virtual reality, in particular to a collision detection optimization method based on curvature point clustering and decision tree. Background technique [0002] The higher the accuracy of the human soft tissue model, the more complex the model and the greater the amount of calculation. Reducing the amount of calculation in the process of model loading and collision detection, and improving the speed of collision detection can effectively improve the real-time performance of the virtual surgery simulation system. At present, the collision detection algorithm of spatial structure mainly includes space division method and hierarchical bounding box method. The former simulates the whole scene through hierarchical subdivision technology, focusing on reducing the object pairs that may collide; the latter constructs a hierarchical bounding box for each object. Scenario simulation, focusing on...

AI Technical Summary

Problems solved by technology

For the four bounding box algorithms, there are various shortcomings such as difficult construction, poor compactness, complex intersection test, and low efficiency.

There have been many studies trying to mix various bounding boxes to complement each other, but the effect is not good

Images