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 proposes an O(nlog n) time algorithm capable of finding near-shortest path on polygonal surfaces. Shortest-path planning in 3-dimensional space is an NP-hard problem. Theoretically, if the number of Steiner points in Kanai and Suzuki's algorithm is allowed to approach infinity, the path obtained will be optimal. In practice, the results generated by the KS's algorithm with 29 Steiner points...
Skeleton is a fundamental shape feature of 3D mesh, and it can be used in many areas, such as model search, shape analysis, and mesh deformation. This paper presents a novel skeleton extraction method based on mesh segmentation. Firstly, the mesh is cut off by Dijkstras Algorithm and the number of segments N, then the relevant sub-meshes centers are connected to constitute the skeleton. At last, the...
A new algorithm is proposed for calculating the approximate shortest path on a polyhedral surface. The method mainly uses Dijkstra's algorithm and is based on selective refinement of the discrete graph of a polyhedron. Although the algorithm is an approximation, it has the significant advantages of being fast and easy to implement, it has high approximation accuracy, and is numerically robust. The...
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.