Computational geometry: an introduction
Computational geometry: an introduction
A convex polygon among polygonal obstacles: placement and high-clearance motion
Computational Geometry: Theory and Applications
Mathematical model and efficient algorithms for object packing problem
Computational Geometry: Theory and Applications
Hi-index | 0.00 |
To develop efficient approaches to the solution of packing problems, an analytical description of interactions between two arbitrary 3D objects should be modelled in a suitable way. To this end, the concept of 驴-functions is used. 驴-functions are constructed for each pair of the following so-called primary 3D objects that have boundaries: a sphere, a parallelepiped, a cylinder, and a cone.