Reordering

Reorders vertices of a point cloud by projecting them onto the X-Y plane and computing distances between the projection of each vertex and the projection of the source. Vertices with smaller distance values appear earlier in the reordered stream.

Can also be used for reordering on the basis of the sum of the shortest distance from the projection of the source to the projection of a vertex and the distance from the projection of the vertex to the projection of the target vertex. This type of reordering is needed for single source, single target shortest path problem.

The input is a textfile which contains a sequence of lines which contain 3 numbers corresponding to the X-Y-Z coordinates of a vertex. The output is the text file containing the reordered sequence of vertices. Note that neither the output nor the input files have triangles, or finalize vertex tags.

Example Usage:

---

General

Usage: For single source all targets problem:

order -i input_mesh.txt -o output_mesh.txt -s source_x_coordinate source_y_coordinate source_z_coordinate 
-N number_of_bins_for reordering

For single source single target problem:

order -i input_mesh.txt -o output_mesh.txt -s source_x_coordinate source_y_coordinate source_z_coordinate 
-t target_x_coordinate target_y_coordinate target_z_coordinate -N number_of_bins_for reordering

-- VishalVerma - 17 Dec 2008
to top