- Timestamp:
- May 11, 2010, 11:31:16 AM (14 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
anuga_core/source/anuga/fit_interpolate/search_functions.py
r7713 r7714 72 72 return True, sigma0, sigma1, sigma2, k 73 73 74 # search to bottom of tree from last found leaf75 74 branch = last_triangle[0][1] 76 75 77 76 if branch == -10: 78 77 branch = root 79 80 tri_data = branch.search(x[0], x[1]) 78 79 # test neighbouring tris 80 tri_data = branch.test_leaves(x) 81 triangles = _trilist_from_data(mesh, tri_data) 82 element_found, sigma0, sigma1, sigma2, k = \ 83 _search_triangles_of_vertices(triangles, x) 84 if element_found: 85 return True, sigma0, sigma1, sigma2, k 86 87 # search to bottom of tree from last found leaf 88 tri_data = branch.search(x) 81 89 triangles = _trilist_from_data(mesh, tri_data) 82 90 element_found, sigma0, sigma1, sigma2, k = \ … … 95 103 96 104 for sibling in siblings: 97 tri_data = sibling.search(x [0], x[1])105 tri_data = sibling.search(x) 98 106 triangles = _trilist_from_data(mesh, tri_data) 99 107 element_found, sigma0, sigma1, sigma2, k = \ … … 104 112 branch = branch.parent 105 113 if branch: 106 tri_data = branch.test_leaves(x [0], x[1])114 tri_data = branch.test_leaves(x) 107 115 triangles = _trilist_from_data(mesh, tri_data) 108 116 element_found, sigma0, sigma1, sigma2, k = \ … … 112 120 113 121 return element_found, sigma0, sigma1, sigma2, k 114 115 116 ## Get triangles in the cell that the point is in.117 #tri_data = root.search(x[0], x[1])118 #triangles = _trilist_from_data(mesh, tri_data)119 120 #element_found, sigma0, sigma1, sigma2, k = \121 #_search_triangles_of_vertices(triangles, x)122 123 #if element_found:124 #return True, sigma0, sigma1, sigma2, k125 122 126 123
Note: See TracChangeset
for help on using the changeset viewer.