python - Queries on large number of small sets and lists -
i need calculations on triangular/tetrahedral meshes in 2 , 3 dimensions. tasks following arise:
- given list of vertices v , list of 3-tuples t indexing v. each vertex v in v, find indices of 3-tuples in t referring v.
- interpreting t triangulation 3-tuples triangles, find 2-tuples representing edges between vertices of triangulation.
- for each of edges, find index of triangles indcident it. (also in 3d 4-tuples , polyhedrons instead of triangles.)
i think done list comprehensions, extremely worry performance when scaling 100'000s or 1'000'000s of triangles. had scipy's graph library, that's rather finding paths in graph , stuff.
i wonder whether python offers functions it, or how problem named in order start search.
Comments
Post a Comment