Dijkstra based reordering

Reorders vertices using the Dijkstra method with A-star heuristic. The heuristic distance function is euclidean distance. The vertices are ordered in terms of the sum of their dijkstra distance from source and the heuristic(euclidean) distance from target. Using the heuristic lowerbound and the dijkstra distance as upperbound, we can say that the shortest path from the source to target cannot pass through some regions of the input mesh. These regions are not included in the output mesh.

Note that the index of the source in the reordered file is 1.

Example Usage:

---

General

Usage:

dijkstra_order -i input_mesh -o output_mesh -s source_index_number -t target_x_coordinate target_y_coordinate target_z_coordinate 
-TOL tolerance_for_target_coordinates

-- VishalVerma - 16 Dec 2008