The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper introduces the problem of computing the shortest Euclidean path of a plural number of sequenced spherical balls in 3D. Based on the author's previous works and the technique of pair-wisely local optimization, a heuristic algorithm was proposed to solve the problem. Empirical results are competing with random selection and the nearest neighbor search algorithm. The experiments have shown...
This paper introduces the problem of computing the shortest Euclidean path touring n disjoint circles in 2D. The problem is a generalization of Travelling Salesman Problem (TSP) in Euclidean 2D space and is not a purely combinatorial problem. Based on the author's previous work, this paper proposes an exact algorithm to solve the studied problem. The proposed algorithm can be conducted in layered...
Computing the Euclidean shortest path among a plural number of spherical balls is an interesting problem in 3D computer graphics. Finding the Euclidean shortest path of three spheres is fundamental to the more general n-sphere problem. In this paper, we develop an exact algorithm for computing the shortest path of three spheres in 3D space. The problem is firstly reduced to a corresponding problem...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.