An Efficient and Practical Three-Dimensional Path Finding Algorithm in 3D Games
碩士 === 元智大學 === 資訊工程學系 === 93 === 3D game is a virtual environment that is constructed with various objects. 3D navigation is one kind of virtual environment technology that can be used as an aid to designers of complex spatial arrangements. Path finding in 3D navigation is to locate an object or ro...
Main Authors: | Hsieh, Ping-Han, 謝秉翰 |
---|---|
Other Authors: | K. Robert Lai |
Format: | Others |
Language: | en_US |
Published: |
2005
|
Online Access: | http://ndltd.ncl.edu.tw/handle/20749935405287194561 |
Similar Items
-
Path finding in 2d games
by: Mandachescu, Cosmin Adrian
Published: (2003) -
An Algorithm for Solving Fuzzy Axial Three-Dimensional Assignment Problem
by: Hsieh, Bai-Han, et al.
Published: (2013) -
Algorithms for finding optimal paths in network games with p players
by: R. Boliac, et al.
Published: (1997-08-01) -
Research of Algorithm of Three dimensional Continuous Path
by: poli, et al.
Published: (2002) -
Efficiency of distributed queueing games and of path discovery algorithms
by: Doncel, Josu
Published: (2015)