HELP!!! RTS Quadtree nearest opponent

[ezravitto]

Hi! I need help implementing quadtree to my rts game, but the "insertion" part of Quadtree doesn't make sense to me, gml is the only programming language i use.

so here's my insertion code:

if instance_exists(oQuadPointTest)
{
var _check;

_check = instance_find(oQuadPointTest,instance_number(oQuadPointTest)-1)
if !scrContain(_check){return 0;}//this will return the object id if it is true

if ds_list_size(_objects)<capacity
{ds_list_add(_objects,_check);}
else
{if !_divided {scrSubdivide();}}
}

Thankyou for giving time!

 

[ezravitto]

this is the result.
the leaf of quadtree only detects the newest object. i know it was inside the code check for "instance_number",
but what i wanted to happen is for every leaf to check if they contain objects in their region.. i hope that make sense?
and also how can a quadtree count the objects inside it?

 

[vdweller]

A rather incomplete and unoptimized quadtree implementation with find k-nearest neighbors capability:

Quadtree

MediaFire is a simple to use free service that lets you put all your photos, documents, music, and video in a single place so you can access them anywhere and share them everywhere.

www.mediafire.com