Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  describes a practical and efficient collision detection algorithm for non-convex objects in R/sup 3/. The algorithm is based on two other distance calculation algorithms: one is for convex polyhedra and the other is for non-convex polyhedra. The applied algorithm is switched beten convex and non-convex, according to the distance beten the objects. The closest points beten the objects are follod continuously in time and can be calculated by searching for the nearest neighbors of the previous closest points. This feature greatly improves the distance calculation speed and makes it possible, for instance, to pick and move an object with a mouse, interactively getting the distance beten the object and other objects. The algorithm is implemented in C++, and embedded in a series of C++ class libraries for a graphic simulation system-which the authors have named ContactScope.
['Yuichi Sato', 'Mitsunori Hirata', 'Tsugito Maruyama', 'Yuichi Arita']
I am writing a research paper on a idea Efficient collision detection using fast distance-calculation algorithms for convex and non-convex objects
[{"from": "human", "value": "I am writing a research paper on a idea Efficient collision detection using fast distance-calculation algorithms for convex and non-convex objects"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  describes a practical and efficient collision detection algorithm for non-convex objects in R/sup 3/. The algorithm is based on two other distance calculation algorithms: one is for convex polyhedra and the other is for non-convex polyhedra. The applied algorithm is switched beten convex and non-convex, according to the distance beten the objects. The closest points beten the objects are follod continuously in time and can be calculated by searching for the nearest neighbors of the previous closest points. This feature greatly improves the distance calculation speed and makes it possible, for instance, to pick and move an object with a mouse, interactively getting the distance beten the object and other objects. The algorithm is implemented in C++, and embedded in a series of C++ class libraries for a graphic simulation system-which the authors have named ContactScope."}]