nikhildagarwal / 3d-search-visualizer

3D Path-Finding Visualizer

In this Project, I utilize an A* algorithm given a 3D grid to find the optimal path from a given start to finish. You can use different heuristics (manhattan, euclidean) as well as varying ranges of motion (rigid, diagonal). The final path, grid space, and obstacles are plotted using MatplotLib on 3D axes. The black dots signify obstacles, the green signifies cells that have been searched, and the path is marked in red. Some examples are below:

• manhattan distance
• diagonal motion enabled

• euclidean distance
• diagonal motion enabled

• manhattan distance
• diagonal motion disabled

• euclidean distance
• diagonal motion enabled

• manhattan distance
• diagonal motion enabled

• euclidean distance
• diagonal motion enabled

• manhattan distance
• diagonal motion disabled