/**
* Generates the tree. The following collaboration diagram
* shows the recursion trough the make process:
* <p>
* <img src="doc-files/Tree-2.png" />
* <p>
*
* @throws Exception
*/
public void make(Object progress)
{
this.progress = progress;
setupGenProgress();
csparams.prepare(seed);
maxPoint = new Vector3(-float.MaxValue, -float.MaxValue, -float.MaxValue);
minPoint = new Vector3(float.MaxValue, float.MaxValue, float.MaxValue);
Console.WriteLine("Tree species: " + csparams.Species + ", Seed: " + seed);
Console.WriteLine("making " + csparams.Species + "(" + seed + ") ");
// create the trunk and all its stems and leaves
DX_Transformation transf = new DX_Transformation();
DX_Transformation trf;
float angle;
float dist;
CS_LevelParams lpar = csparams.getLevelParams(0);
for (int i = 0; i < lpar.nBranches; i++)
{
trf = trunkDirection(transf, lpar);
angle = lpar.var(360);
dist = lpar.var(lpar.nBranchDist);
trf = trf.translate(new Vector3(dist * (float)Math.Sin(angle), dist * (float)Math.Cos(angle), 0));
CS_StemImpl trunk = new CS_StemImpl(this, null, 0, trf, 0);
trunks.Add(trunk);
trunk.index = 0;
trunk.make();
}
// set leafCount and stemCount for the tree
if (csparams.Leaves == 0)
{
setLeafCount(0);
}
else
{
CS_LeafCounter leafCounter = new CS_LeafCounter();
traverseTree(leafCounter);
setLeafCount(leafCounter.getLeafCount());
}
CS_StemCounter stemCounter = new CS_StemCounter();
traverseTree(stemCounter);
setStemCount(stemCounter.getStemCount());
// making finished
Console.WriteLine("making " + csparams.Species + " Done. ");
// TODO
//progress.endPhase();
}
/**
* Make substems of the current stem
*
* @param segment
*/
void makeSubstems(CS_SegmentImpl segment)
{
// creates substems for the current segment
CS_LevelParams lpar_1 = par.getLevelParams(stemlevel + 1);
/*
if (Console.debug())
DBG("Stem.make_substems(): substems_per_segment "+substemsPerSegment);
*/
float subst_per_segm;
float offs;
if (stemlevel > 0)
{
// full length of stem can have substems
subst_per_segm = substemsPerSegment;
if (segment.index == 0)
{
offs = parent.stemRadius(offset) / segmentLength;
}
else { offs = 0; }
}
else if (segment.index * segmentLength > par.BaseSize * length)
{
// segment is fully out of the bare trunk region => normal nb of substems
subst_per_segm = substemsPerSegment;
offs = 0;
}
else if ((segment.index + 1) * segmentLength <= par.BaseSize * length)
{
// segment is fully part of the bare trunk region => no substems
return;
}
else
{
// segment has substems in the upper part only
offs = (par.BaseSize * length - segment.index * segmentLength) / segmentLength;
subst_per_segm = substemsPerSegment * (1 - offs);
}
// how many substems in this segment
int substems_eff = (int)(subst_per_segm + lpar.substemErrorValue + 0.5);
// adapt error value
lpar.substemErrorValue -= (substems_eff - subst_per_segm);
if (substems_eff <= 0) return;
//DBG("Stem.make_substems(): substems_eff: "+substems_eff);
// what distance between the segements substems
float dist = (1.0f - offs) / substems_eff * lpar_1.nBranchDist;
float distv = dist * 0.25f; // lpar_1.nBranchDistV/2;
//DBG("Stem.make_substems(): offs: "+offs+" dist: "+dist+" distv: "+distv);
for (int s = 0; s < substems_eff; s++)
{
// where on the segment add the substem
float where = offs + dist / 2 + s * dist + lpar_1.var(distv);
//offset from stembase
float offset = (segment.index + where) * segmentLength;
/*
DBG("Stem.make_substems(): offset: "+ offset+" segminx: "+segment.index
+" where: "+where+ " seglen: "+segmentLength);
*/
DX_Transformation trf = substemDirection(segment.transf, offset);
trf = segment.substemPosition(trf, where);
// create new substem
CS_StemImpl substem = new CS_StemImpl(tree, this, stemlevel + 1, trf, offset);
substem.index = substems.Count;
//DBG("Stem.make_substems(): make new substem");
if (substem.make())
{
substems.Add(substem);
//
//if (substem.segments.size()==0)
// throw new ArbaroException("No segments created for substem "+substem.getTreePosition());
}
}
}
/**
* Generates the tree. The following collaboration diagram
* shows the recursion trough the make process:
* <p>
* <img src="doc-files/Tree-2.png" />
* <p>
*
* @throws Exception
*/
public void make(Object progress)
{
this.progress = progress;
setupGenProgress();
csparams.prepare(seed);
maxPoint = new Vector3(-float.MaxValue, -float.MaxValue, -float.MaxValue);
minPoint = new Vector3(float.MaxValue, float.MaxValue, float.MaxValue);
Console.WriteLine("Tree species: " + csparams.Species + ", Seed: " + seed);
Console.WriteLine("making " + csparams.Species + "(" + seed + ") ");
// create the trunk and all its stems and leaves
DX_Transformation transf = new DX_Transformation();
DX_Transformation trf;
float angle;
float dist;
CS_LevelParams lpar = csparams.getLevelParams(0);
for (int i = 0; i < lpar.nBranches; i++)
{
trf = trunkDirection(transf, lpar);
angle = lpar.var(360);
dist = lpar.var(lpar.nBranchDist);
trf = trf.translate(new Vector3(dist * (float)Math.Sin(angle), dist * (float)Math.Cos(angle), 0));
CS_StemImpl trunk = new CS_StemImpl(this, null, 0, trf, 0);
trunks.Add(trunk);
trunk.index = 0;
trunk.make();
}
// set leafCount and stemCount for the tree
if (csparams.Leaves == 0) setLeafCount(0);
else
{
CS_LeafCounter leafCounter = new CS_LeafCounter();
traverseTree(leafCounter);
setLeafCount(leafCounter.getLeafCount());
}
CS_StemCounter stemCounter = new CS_StemCounter();
traverseTree(stemCounter);
setStemCount(stemCounter.getStemCount());
// making finished
Console.WriteLine("making " + csparams.Species + " Done. ");
// TODO
//progress.endPhase();
}
/**
* Make substems of the current stem
*
* @param segment
*/
void makeSubstems(CS_SegmentImpl segment)
{
// creates substems for the current segment
CS_LevelParams lpar_1 = par.getLevelParams(stemlevel + 1);
/*
* if (Console.debug())
* DBG("Stem.make_substems(): substems_per_segment "+substemsPerSegment);
*/
float subst_per_segm;
float offs;
if (stemlevel > 0)
{
// full length of stem can have substems
subst_per_segm = substemsPerSegment;
if (segment.index == 0)
{
offs = parent.stemRadius(offset) / segmentLength;
}
else
{
offs = 0;
}
}
else if (segment.index * segmentLength > par.BaseSize * length)
{
// segment is fully out of the bare trunk region => normal nb of substems
subst_per_segm = substemsPerSegment;
offs = 0;
}
else if ((segment.index + 1) * segmentLength <= par.BaseSize * length)
{
// segment is fully part of the bare trunk region => no substems
return;
}
else
{
// segment has substems in the upper part only
offs = (par.BaseSize * length - segment.index * segmentLength) / segmentLength;
subst_per_segm = substemsPerSegment * (1 - offs);
}
// how many substems in this segment
int substems_eff = (int)(subst_per_segm + lpar.substemErrorValue + 0.5);
// adapt error value
lpar.substemErrorValue -= (substems_eff - subst_per_segm);
if (substems_eff <= 0)
{
return;
}
//DBG("Stem.make_substems(): substems_eff: "+substems_eff);
// what distance between the segements substems
float dist = (1.0f - offs) / substems_eff * lpar_1.nBranchDist;
float distv = dist * 0.25f; // lpar_1.nBranchDistV/2;
//DBG("Stem.make_substems(): offs: "+offs+" dist: "+dist+" distv: "+distv);
for (int s = 0; s < substems_eff; s++)
{
// where on the segment add the substem
float where = offs + dist / 2 + s * dist + lpar_1.var(distv);
//offset from stembase
float offset = (segment.index + where) * segmentLength;
/*
* DBG("Stem.make_substems(): offset: "+ offset+" segminx: "+segment.index
+" where: "+where+ " seglen: "+segmentLength);
*/
DX_Transformation trf = substemDirection(segment.transf, offset);
trf = segment.substemPosition(trf, where);
// create new substem
CS_StemImpl substem = new CS_StemImpl(tree, this, stemlevel + 1, trf, offset);
substem.index = substems.Count;
//DBG("Stem.make_substems(): make new substem");
if (substem.make())
{
substems.Add(substem);
//
//if (substem.segments.size()==0)
// throw new ArbaroException("No segments created for substem "+substem.getTreePosition());
}
}
}
