Hi,
I am using libmesh to read a large unstructured grid data. The mesh info is
below:
Mesh Information:
elem_dimensions()={3}
spatial_dimension()=1
n_nodes()=67855938
n_local_nodes()=0
n_elem()=181423412
n_local_elem()=0
n_active_elem()=181423412
n_subdomains()=0
n_partitions()=1
n_processors()=1
n_threads()=1
processor_id()=0
I found that when locating a point by PointLocatorTree, it always took much
time (about 50s or even more). It seems that the locator always falls into
perform_linear_search
<http://libmesh.github.io/doxygen/classlibMesh_1_1PointLocatorTree.html#acd313428c9a4551d7e1aaa141e7ae8e7>
function when executing operator()
<http://libmesh.github.io/doxygen/classlibMesh_1_1PointLocatorTree.html#a08990e437871fc26e3043806aef8dfaa>.
So is there any method to improve the efficiency of point locator?
Best regards,
------------------------------------------------------------------------------
Attend Shape: An AT&T Tech Expo July 15-16. Meet us at AT&T Park in San
Francisco, CA to explore cutting-edge tech and listen to tech luminaries
present their vision of the future. This family event has something for
everyone, including kids. Get more information and register today.
http://sdm.link/attshape
_______________________________________________
Libmesh-users mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/libmesh-users
