Blender Git Commit Log
Git Commits -> Revision 028634c
Revision 028634c by Antonis Ryakiotakis (soc-2012-bratwurst) August 5, 2012, 02:34 (GMT) |
Isomap Unwrapper ================= * Fix, pass squares of distances to eigen solver * Use a heap instead of a stack to get the next vertex to iterate through in Dijkstra graph search algorithm. This is needed because we may follow a non-optimal path and not get the nearest path between vertices. This introduces the O(n*log(n)) performance (was more like simply O(n) till now, but unfortunately, it was incorrect). |
Commit Details:
Full Hash: 028634c9abed70e17dd0fad7e822dfd8c1c4eb40
SVN Revision: 49569
Parent Commit: 32c5165
Lines Changed: +62, -42
Master Commits
MiikaHweb | 2003-2021