dolfinx.cpp.geometry
Geometry module
Functions
|
|
|
|
|
Overloaded function. |
|
|
|
|
|
|
|
Classes
|
- class dolfinx.cpp.geometry.BoundingBoxTree(self: dolfinx.cpp.geometry.BoundingBoxTree, mesh: dolfinx.cpp.mesh.Mesh, dim: int, entities: numpy.ndarray[numpy.int32], padding: float)
Bases:
pybind11_object
- create_global_tree(self: dolfinx.cpp.geometry.BoundingBoxTree, comm: MPICommWrapper) dolfinx.cpp.geometry.BoundingBoxTree
- get_bbox(self: dolfinx.cpp.geometry.BoundingBoxTree, i: int) numpy.ndarray[numpy.float64]
- property num_bboxes
- dolfinx.cpp.geometry.compute_closest_entity(tree: dolfinx::geometry::BoundingBoxTree, midpoint_tree: dolfinx::geometry::BoundingBoxTree, mesh: dolfinx.cpp.mesh.Mesh, points: numpy.ndarray[numpy.float64]) numpy.ndarray[numpy.int32]
- dolfinx.cpp.geometry.compute_colliding_cells(mesh: dolfinx.cpp.mesh.Mesh, candidate_cells: dolfinx.cpp.graph.AdjacencyList_int32, points: numpy.ndarray[numpy.float64]) Union[dolfinx.cpp.graph.AdjacencyList_int32, numpy.ndarray[numpy.int32]]
- dolfinx.cpp.geometry.compute_collisions(*args, **kwargs)
Overloaded function.
compute_collisions(tree: dolfinx::geometry::BoundingBoxTree, points: numpy.ndarray[numpy.float64]) -> dolfinx.cpp.graph.AdjacencyList_int32
compute_collisions(tree0: dolfinx::geometry::BoundingBoxTree, tree1: dolfinx::geometry::BoundingBoxTree) -> numpy.ndarray[numpy.int32]
- dolfinx.cpp.geometry.compute_distance_gjk(p: numpy.ndarray[numpy.float64], q: numpy.ndarray[numpy.float64]) numpy.ndarray[numpy.float64]
- dolfinx.cpp.geometry.create_midpoint_tree(mesh: dolfinx.cpp.mesh.Mesh, tdim: int, entities: numpy.ndarray[numpy.int32]) dolfinx::geometry::BoundingBoxTree
- dolfinx.cpp.geometry.determine_point_ownership(arg0: dolfinx.cpp.mesh.Mesh, arg1: numpy.ndarray[numpy.float64]) Tuple[List[int], List[int], List[float], List[int]]
- dolfinx.cpp.geometry.squared_distance(mesh: dolfinx.cpp.mesh.Mesh, dim: int, indices: List[int], points: numpy.ndarray[numpy.float64]) numpy.ndarray[numpy.float64]