internal static com.epl.geometry.QuadTree BuildQuadTree_(com.epl.geometry.MultiPointImpl multipointImpl)
{
com.epl.geometry.Envelope2D extent = new com.epl.geometry.Envelope2D();
multipointImpl.QueryEnvelope2D(extent);
com.epl.geometry.QuadTree quadTree = new com.epl.geometry.QuadTree(extent, 8);
com.epl.geometry.Envelope2D boundingbox = new com.epl.geometry.Envelope2D();
com.epl.geometry.Point2D pt;
for (int i = 0; i < multipointImpl.GetPointCount(); i++)
{
pt = multipointImpl.GetXY(i);
boundingbox.SetCoords(pt.x, pt.y, pt.x, pt.y);
quadTree.Insert(i, boundingbox, -1);
}
return(quadTree);
}
public static com.epl.geometry.QuadTree BuildQuadTree(com.epl.geometry.MultiPath multipath)
{
com.epl.geometry.Envelope2D extent = new com.epl.geometry.Envelope2D();
multipath.QueryEnvelope2D(extent);
com.epl.geometry.QuadTree quadTree = new com.epl.geometry.QuadTree(extent, 8);
int hint_index = -1;
com.epl.geometry.SegmentIterator seg_iter = multipath.QuerySegmentIterator();
while (seg_iter.NextPath())
{
while (seg_iter.HasNextSegment())
{
com.epl.geometry.Segment segment = seg_iter.NextSegment();
int index = seg_iter.GetStartPointIndex();
com.epl.geometry.Envelope2D boundingbox = new com.epl.geometry.Envelope2D();
segment.QueryEnvelope2D(boundingbox);
hint_index = quadTree.Insert(index, boundingbox, hint_index);
}
}
return(quadTree);
}
public static void Test_perf_quad_tree()
{
com.epl.geometry.Envelope extent1 = new com.epl.geometry.Envelope();
extent1.SetCoords(-1000, -1000, 1000, 1000);
com.epl.geometry.RandomCoordinateGenerator generator1 = new com.epl.geometry.RandomCoordinateGenerator(1000, extent1, 0.001);
//HiResTimer timer;
for (int N = 16; N <= 1024; N *= 2)
{
//timer.StartMeasurement();
com.epl.geometry.Envelope2D extent = new com.epl.geometry.Envelope2D();
extent.SetCoords(-1000, -1000, 1000, 1000);
System.Collections.Generic.Dictionary <int, com.epl.geometry.Envelope2D> data = new System.Collections.Generic.Dictionary <int, com.epl.geometry.Envelope2D>(0);
com.epl.geometry.QuadTree qt = new com.epl.geometry.QuadTree(extent, 10);
for (int i = 0; i < N; i++)
{
com.epl.geometry.Envelope2D env = new com.epl.geometry.Envelope2D();
com.epl.geometry.Point2D center = generator1.GetRandomCoord().GetXY();
double w = 10;
env.SetCoords(center, w, w);
env.Intersect(extent);
if (env.IsEmpty())
{
continue;
}
int h = qt.Insert(i, env);
data[h] = env;
}
int ecount = 0;
com.epl.geometry.AttributeStreamOfInt32 handles = new com.epl.geometry.AttributeStreamOfInt32(0);
com.epl.geometry.QuadTree.QuadTreeIterator iter = qt.GetIterator();
System.Collections.Generic.IEnumerator <System.Collections.Generic.KeyValuePair <int, com.epl.geometry.Envelope2D> > pairs = data.GetEnumerator();
while (pairs.MoveNext())
{
System.Collections.Generic.KeyValuePair <int, com.epl.geometry.Envelope2D> entry = pairs.Current;
iter.ResetIterator((com.epl.geometry.Envelope2D)entry.Value, 0.001);
bool remove_self = false;
for (int h = iter.Next(); h != -1; h = iter.Next())
{
if (h != entry.Key)
{
handles.Add(h);
}
else
{
remove_self = true;
}
ecount++;
}
for (int i_1 = 0; i_1 < handles.Size(); i_1++)
{
qt.RemoveElement(handles.Get(i_1));
}
//remove elements that were selected.
if (remove_self)
{
qt.RemoveElement(entry.Key);
}
handles.Resize(0);
}
}
}