in_element_aabb
in_element_aabb(queries, V, F)
Find which triangle or tet a set of query points lay on
Given a set of query points and a triangle or tetrahedral mesh, construct an AABB data structure to learn which specific mesh elements each query point is in.
Parameters:
Name | Type | Description | Default |
---|---|---|---|
queries |
numpy double array
|
Matrix of query point coordinates |
required |
V |
(n,d) numpy array
|
vertex list of a triangle mesh |
required |
F |
(m,3) or (m,4) numpy int array
|
face/tet index list of a triangle/tet mesh |
required |
Returns:
Name | Type | Description |
---|---|---|
I |
numpy int array
|
Vector of indeces into F of the elements that contain each query point (-1 means no containing element). |
See Also
Notes
Examples:
V,F = gpytoolbox.regular_square_mesh(23)
num_samples = 100
queries = np.random.rand(num_samples,3)
I = in_element_aabb(queries,V,F)
Source code in src/gpytoolbox/in_element_aabb.py
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 |
|