Dennis,

Assuming for the moment that each quad 4-tuple is a finite element that contains one or more tire reinforcement items, and that each quad 4-tuple is "sandwiched" in between two hex 8-node finite elements, then the quad's 4-tuple is also a surface facet of two different 8-node hexahedrons. Both hexhedrons are the 'closest' hexhedrons to the quad. Given the usual organization of 'element blocks' in the Exodus-II datum structures, the two closest hexahedrons will be located on the surface of their respective element blocks.

Using material ID's which are also element block ID's, have the software generate surface side-sets for each of these two element blocks specified with these two material ID's. With luck, each member in the side-set will be specified as a 2-tuple, (Elem# in the block, Quad-Face# in the hexah)

With his info, you can confine your search to finding the side-set item that has a 4-tuple that matches your quad's 4-tuple. The search is reduced to a relatively small collection of hexahedral surface 4-tuple faces. 

Hope this helps.

Samuel W Key
FMA Development, LLC
1005 39th Ave NE
Great Falls, Montana 59404
USA

On 8/20/2015 1:51 PM, Dennis Conklin wrote:

All,

 

I have an Exodus, multi-block model.  Most of the blocks are hex elements, and some are layers of quads (tires are composite structures).  I would like to establish local strains which are oriented in the direction of the nearest quad layer.  To do this I need to identify, for each hex in the model, which quad element in the model is closest to the hex.    Then I can extract directions from the quad element and rotate the strain tensor in the hex to these local coordinates.

 

My question is,  is there some clever and efficient way to quickly determine the nearest quad for each hex in the model.  Keep in mind that there are multiple blocks of quads, but if there is some way to address the quad blocks one at a time, I could make this work.   

 

The brute force way is:

Loop over every hex in the model:

      Loop over every quad in the model:

             Calculate the distance between hex and quad

             Smallest distance wins!

 

That is a pretty brutally inefficient calc (several million hex elements) that I am trying to avoid – any ideas about how best to approach this.   I’m hoping for some elegant way to use connectivity or something of that sort.

 

Thanks for looking

 

Dennis



_______________________________________________
Powered by www.kitware.com

Visit other Kitware open-source projects at http://www.kitware.com/opensource/opensource.html

Please keep messages on-topic and check the ParaView Wiki at: http://paraview.org/Wiki/ParaView

Search the list archives at: http://markmail.org/search/?q=ParaView

Follow this link to subscribe/unsubscribe:
http://public.kitware.com/mailman/listinfo/paraview

_______________________________________________
Powered by www.kitware.com

Visit other Kitware open-source projects at 
http://www.kitware.com/opensource/opensource.html

Please keep messages on-topic and check the ParaView Wiki at: 
http://paraview.org/Wiki/ParaView

Search the list archives at: http://markmail.org/search/?q=ParaView

Follow this link to subscribe/unsubscribe:
http://public.kitware.com/mailman/listinfo/paraview

Reply via email to