English  |  正體中文  |  简体中文  |  Items with full text/Total items : 27221/39064
Visitors : 2404846      Online Users : 60
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/41777

Title: The Planning of a 3D Shortest Path in a Volume
Authors: Chang-Chien Chou;Wan-Kuang Hsieh;Huei-Yuan Lee
Contributors: 國立臺灣海洋大學:商船學系
Keywords: Computational geometry;Computer graphics;Information management;Path planning;Design automation;Spectroscopy;Chemicals;Joining processes
Date: 2003-10
Issue Date: 2017-03-27T06:46:59Z
Publisher: AASRC
Abstract: 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 of computing the shortest path of three coplanar circles, and turns out to a two points and one circle path planning problem. After applying the general root formula of the shortest path of two points and one circle together with the method of axis rotation, the algorithm is build. Empirical results accompany a brute force method for comparison have shown the correctness and effectiveness of the proposed algorithm. This result can be applied in 3D computer graphics, computer-aided design and the molecular geometry.
Relation: 35(2) pp.197-202
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/41777
Appears in Collections:[商船學系] 期刊論文

Files in This Item:

File Description SizeFormat
04811457.pdf222KbAdobe PDF18View/Open


All items in NTOUR are protected by copyright, with all rights reserved.

 


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback