Abstract
In a 3D game environment, pathfinding or graph traversal is performed using the ASUP*/SUP algorithm with 2D layers. However, in a 3D virtual environment or space, ASUP*/SUP Algorithm that uses 2D layers is limited. Therefore, it is necessary to use an algorithm that uses 3D layers in a 3D game environment. This study shows that a 3D ASUP*/SUP Algorithm may configure the path between two nodes faster than an ASUP*/SUP Algorithm that uses 2D layers in a 3D game environment.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
