def optimizeOverlap(t, double_wall=0, priorities=[], graph=None,
intersectionsDict=None):
if graph is None:
tb = Cmpi.createBBoxTree(t)
graph = Cmpi.computeGraph(tb, type='bbox2',
intersectionsDict=intersectionsDict)
tl = Cmpi.addXZones(t, graph)
tl = Cmpi.convert2PartialTree(tl)
# print info
zones = Internal.getZones(tl)
#print 'Rank %d has %d zones.'%(Cmpi.rank, len(zones))
tl = X.optimizeOverlap(tl, double_wall, priorities, intersectionsDict)
tl = Cmpi.rmXZones(tl)
return tl
# - rmXZones (pyTree) -
import Converter.PyTree as C
import Converter.Mpi as Cmpi
import Distributor2.PyTree as Distributor2
import Generator.PyTree as G
# Cree le fichier test
if (Cmpi.rank == 0):
a = G.cart((0, 0, 0), (1, 1, 1), (10, 10, 10))
b = G.cart((9, 0, 0), (1, 1, 1), (10, 10, 10))
t = C.newPyTree(['Base', a, b])
C.convertPyTree2File(t, 'test.cgns')
Cmpi.barrier()
# Relit des zones par procs
t = Cmpi.convertFile2SkeletonTree('test.cgns')
(t, dic) = Distributor2.distribute(t, NProc=Cmpi.size, algorithm='fast')
t = Cmpi.readZones(t, 'test.cgns', proc=Cmpi.rank)
# Cree le bbox tree
tb = Cmpi.createBBoxTree(t)
# Cree le graph
graph = Cmpi.computeGraph(tb)
# Add X Zones
t = Cmpi.addXZones(t, graph)
t = Cmpi.rmXZones(t)
if Cmpi.rank == 0:
C.convertPyTree2File(t, 'out.cgns')
