Path finding in 2d games
A major problem faced by game developers these days is the ability to effectively plan the motion from a Source object to a Target situated in an environment with several Obstacles . This paper proposes a framework for game design in which all objects have a precalculated bounding box. Polygons wit...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
2003
|
| Online Access: | http://spectrum.library.concordia.ca/2063/1/MQ77991.pdf Mandachescu, Cosmin Adrian <http://spectrum.library.concordia.ca/view/creators/Mandachescu=3ACosmin_Adrian=3A=3A.html> (2003) Path finding in 2d games. Masters thesis, Concordia University. |