/// <summary>
/// The location for a given eltIndex for a node will be one
/// of { Null, Interior, Boundary }.
/// A node may be on both the boundary and the interior of a point;
/// in this case, the rule is that the node is considered to be in the boundary.
/// The merged location is the maximum of the two input values.
/// </summary>
/// <param name="label2"></param>
/// <param name="eltIndex"></param>
public Locations ComputeMergedLocation(Label label2, int eltIndex)
{
Locations loc = Locations.Null;
loc = label.GetLocation(eltIndex);
if (!label2.IsNull(eltIndex))
{
Locations nLoc = label2.GetLocation(eltIndex);
if (loc != Locations.Boundary)
{
loc = nLoc;
}
}
return(loc);
}
/// <summary>
/// The location for a given eltIndex for a node will be one
/// of { Null, Interior, Boundary }.
/// A node may be on both the boundary and the interior of a point;
/// in this case, the rule is that the node is considered to be in the boundary.
/// The merged location is the maximum of the two input values.
/// </summary>
/// <param name="label2"></param>
/// <param name="eltIndex"></param>
public Locations ComputeMergedLocation(Label label2, int eltIndex)
{
Locations loc = Locations.Null;
loc = label.GetLocation(eltIndex);
if (!label2.IsNull(eltIndex))
{
Locations nLoc = label2.GetLocation(eltIndex);
if (loc != Locations.Boundary)
loc = nLoc;
}
return loc;
}
