A high-performance implementation of the A* (A-Star) Pathfinding Algorithm written in C++, featuring a real-time OpenGL 3D visualization.
This project visualizes how the A* algorithm explores nodes and finds the shortest path between two points in a 3D environment. It was built to practice low-level graphics programming and efficient algorithm implementation.
- Language: C++14
- Graphics API: OpenGL 3.3
- Windowing & Input: GLFW
- OpenGL Extension Wrangler: GLEW
- Image Loading: stb_image
- Mathematics: GLM (OpenGL Mathematics)
- 3D Model Loading (NOT IMPLEMENTED): Assimp
- Real-time Visualization: Watch the algorithm expand nodes (Open set / Closed set).
- Interactive Camera: Navigate the 3D space to view the path from different angles.
- Optimized Performance: Efficient grid handling and rendering.
This project was developed with the help of these amazing resources:
- LearnOpenGL.com - The best site for learning modern OpenGL.
- TheCherno C++ / OpenGL series - Great insights into engine architecture.
