Browsing projects by Tag(s)

Select a tag to browse associated projects and drill deeper into the tag cloud.

Showing page 1 of 1

Argorha Pathfinding is an algorithm which permit you to find your way into a polygon soup ( 3D world ) efficently by precalculating a system of sectors and portals. It is integrated into GOOF Editor and can be used without that editor. AStar included.

5.0
 
  0 reviews  |  1 user  |  216,353 lines of code  |  0 current contributors  |  Analyzed 3 days ago
 
 

This code is part of the site Justin Heyes-Jones has been running since 2001, teaching folk about the A algorithm. See http://www.heyes-jones.com/astar.html to learn more. The code is designed to be easy to understand, easy to add your own runtime debugging monitoring the open and closed lists ... [More] for example. Efficiency is considered, and the open list is implemented as a priority queue using STL. Now on google hosting, the project is now open to the public to help me maintain different versions and fix bugs. Using a templated class to allow polymorphism without the overhead of vtables. In addition a simplified and fast memory manager is included, speeding up the search. Two canonical examples of A are provided. The 8-puzzle and a path finder. You can email Justin at justinhj@gmail.com Bug reports can also be added to the Issue Tracking section of this site. [Less]

0
 
  0 reviews  |  1 user  |  0 current contributors
 
 
 
 

Creative Commons License Copyright © 2013 Black Duck Software, Inc. and its contributors, Some Rights Reserved. Unless otherwise marked, this work is licensed under a Creative Commons Attribution 3.0 Unported License . Ohloh ® and the Ohloh logo are trademarks of Black Duck Software, Inc. in the United States and/or other jurisdictions. All other trademarks are the property of their respective holders.