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.Dijkstra_astar
r1.1 - 18 Dec 2008 - 06:13 - Main.guest
topic end
Start of topic |
Skip to actions
*Dijkstra's method with A-star heuristic* Computes shortest path between given source and target using !Dijkstra's method with A-star heuristic. Computes shortest paths on the edges of the mesh. The output is a text file containing a sequence of points. %TOC% ---+++Example Usage: ------------------------------------- ---++++General Usage: <pre> dijkstra_order -i input_mesh -o output_path_file -s source_index_number -t target_x_coordinate target_y_coordinate target_z_coordinate -TOL tolerance_for_target_coordinates </pre> -- Main.VishalVerma - 17 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
>
Dijkstra_astar
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