diff options
author | Campbell Barton <ideasman42@gmail.com> | 2006-12-17 03:08:05 +0300 |
---|---|---|
committer | Campbell Barton <ideasman42@gmail.com> | 2006-12-17 03:08:05 +0300 |
commit | 08e3f8b1dae9cd9776bd9a0221fce9c4de86467d (patch) | |
tree | 4eeecfef2e6cc487478b5a0e4137839f12ad3864 /release/scripts/uvcalc_smart_project.py | |
parent | 3a84791b530ab2fdb5b0e9eccc7b77ac131e93a0 (diff) |
Use ed.key and face.edge_keys to build connectivity data faster.
Diffstat (limited to 'release/scripts/uvcalc_smart_project.py')
-rw-r--r-- | release/scripts/uvcalc_smart_project.py | 17 |
1 files changed, 3 insertions, 14 deletions
diff --git a/release/scripts/uvcalc_smart_project.py b/release/scripts/uvcalc_smart_project.py index 88b83fe546a..fef963af0b5 100644 --- a/release/scripts/uvcalc_smart_project.py +++ b/release/scripts/uvcalc_smart_project.py @@ -171,21 +171,10 @@ def island2Edge(island): f_uvkey= map(tuple, f_uv) - for vIdx in xrange(len(f_v)): - + for vIdx, edkey in enumerate(f.edge_keys): unique_points[f_uvkey[vIdx]] = f_uv[vIdx] - - - if f_v[vIdx].index > f_v[vIdx-1].index: - i1= vIdx-1; i2= vIdx - else: - i1= vIdx; i2= vIdx-1 - - try: - edges[ f_uvkey[i1], f_uvkey[i2] ] *= 0 # sets eny edge with more then 1 user to 0 are not returned. - - except: - edges[ f_uvkey[i1], f_uvkey[i2] ] = (f_uv[i1] - f_uv[i2]).length, + try: edges[ f_uvkey[edkey[0]], f_uvkey[edkey[1]] ] *= 0 # sets eny edge with more then 1 user to 0 are not returned. + except: edges[ f_uvkey[edkey[0]], f_uvkey[edkey[1]] ] = (f_uv[i1] - f_uv[i2]).length, # If 2 are the same then they will be together, but full [a,b] order is not correct. |