Skip to topic
|
Skip to bottom
Jump:
TModeling
TModeling Web
TModeling Web Home
Changes
Notify
Index
Search
Webs
BioGeometry
Main
TModeling
TWiki
Edit
Attach
Printable
TModeling.Dijk_order
r1.1 - 18 Dec 2008 - 07:29 - Main.guest
topic end
Start of topic |
Skip to actions
*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. %TOC% ---+++Example Usage: ------------------------------------- ---++++General Usage: <pre> dijk_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 </pre> -- Main.VishalVerma - 16 Dec 2008
to top
End of topic
Skip to action links
|
Back to top
Edit
|
Attach image or document
|
Printable version
|
Raw text
|
More topic actions
Revisions: | r1.1
|
Total page history
|
Backlinks
You are here:
TModeling
>
Dijk_order
to top
Copyright © 1999-2024 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki?
Send feedback