本文整理汇总了C#中Envelope.LongestAxis方法的典型用法代码示例。如果您正苦于以下问题：C# Envelope.LongestAxis方法的具体用法？C# Envelope.LongestAxis怎么用？C# Envelope.LongestAxis使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类Envelope的用法示例。
在下文中一共展示了Envelope.LongestAxis方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: QuadTree
/// <summary>
/// Creates a node and either splits the objects recursively into sub-nodes, or stores them at the node depending on the heuristics.
/// Tree is built top->down
/// </summary>
/// <param name="objList">Geometries to index</param>
/// <param name="depth">Current depth of tree</param>
/// <param name="heurdata">Heuristics data</param>
public QuadTree(List<BoxObjects> objList, uint depth, Heuristic heurdata)
{
_depth = depth;
_box = new Envelope(objList[0].Box);
for (var i = 1; i < objList.Count; i++)
_box.ExpandToInclude(objList[i].Box);
// test our build heuristic - if passes, make children
if (depth < heurdata.maxdepth && objList.Count > heurdata.mintricnt &&
(objList.Count > heurdata.tartricnt || ErrorMetric(_box) > heurdata.minerror))
{
var objBuckets = new List<BoxObjects>[2]; // buckets of geometries
objBuckets[0] = new List<BoxObjects>();
objBuckets[1] = new List<BoxObjects>();
var longaxis = _box.LongestAxis(); // longest axis
var geoavg = 0d; // geometric average - midpoint of ALL the objects
// go through all bbox and calculate the average of the midpoints
var frac = 1.0d/objList.Count;
for (var i = 0; i < objList.Count; i++)
geoavg += objList[i].Box.Centre[longaxis]*frac;
// bucket bbox based on their midpoint's side of the geo average in the longest axis
for (var i = 0; i < objList.Count; i++)
objBuckets[geoavg > objList[i].Box.Centre[longaxis] ? 1 : 0].Add(objList[i]);
//If objects couldn't be splitted, just store them at the leaf
//TODO: Try splitting on another axis
if (objBuckets[0].Count == 0 || objBuckets[1].Count == 0)
{
_child0 = null;
_child1 = null;
// copy object list
_objList = objList;
}
else
{
//We don't need the list anymore;
objList.Clear();
// create new children using the buckets
_child0 = new QuadTree(objBuckets[0], depth + 1, heurdata);
_child1 = new QuadTree(objBuckets[1], depth + 1, heurdata);
}
}
else
{
// otherwise the build heuristic failed, this is
// set the first child to null (identifies a leaf)
_child0 = null;
_child1 = null;
// copy object list
_objList = objList;
}
}