On Wed, 11 Mar 2015, David Knezevic wrote:
On Wed, Mar 11, 2015 at 11:34 AM, Roy Stogner <royst...@ices.utexas.edu> wrote:
On Wed, 11 Mar 2015, David Knezevic wrote:
The issue seems to be in TreeNode<N>::insert().
In particular, it seems that the call to this->refine(); inside
TreeNode<N>::insert is causing an infinite loop.
Yeah, next time a little more warning.
"This seems to hang" and "this is going to suck up 27GB of RAM within
minutes so have fun on your laptop Roy!" are two very distinct issues.
;-)
Sorry about that :) I ctrl-C'd after about 30 seconds...
My code seems to think you've got more than 200 elements whose
bounding boxes all intersect a tiny bounding box around
{-0.0063477736470429497, 2.7432003055871306, -1.113949336408939}},
{-0.0063477736468616191, 2.7432003055871306, -1.1139493364084094}
That's... actually not insane, if you've got a very anisotropic mesh
that's aligned diagonally.
My idea for a fix. After we do the cheap bounding box test:
bool intersects = true;
for (unsigned int d=0; d<elem->dim(); d++)
{
if (max_coord(d) < this->bounding_box.first(d) || min_coord(d) >
this->bounding_box.second(d))
intersects = false;
}
// If not, we should not care about this element.
if (!intersects)
return false;
Let's also do a contains_point test?
---
Roy------------------------------------------------------------------------------
Dive into the World of Parallel Programming The Go Parallel Website, sponsored
by Intel and developed in partnership with Slashdot Media, is your hub for all
things parallel software development, from weekly thought leadership blogs to
news, videos, case studies, tutorials and more. Take a look and join the
conversation now. http://goparallel.sourceforge.net/
_______________________________________________
Libmesh-devel mailing list
Libmesh-devel@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/libmesh-devel
