I wasn't sure whether to post this in the general forum or here as this isn't an actual programming question. But, since this have to be done with MEL/Python I thought I'd just post it here.
I want to make a tool/script that enables me to get all the objects which are inside another (specified) object.
So lets say I have a sphere that should be the "selector"-object, the script has to be pretty accurate to distinguish between the objects inside and outside of the sphere because of the roundness of the sphere. I guess it could be easier with a pCube, I don't know.
Anyway, I've thought about querying the wordspace position of each vtx of the "selector"-object, and then somehow select all of the objects within the worldspace range of the vertexes.
Thing is, I'm not sure how to approach this task. So I was wondering if anyone had any ideas?
bendingiscool from cgcociety mentioned a way to do this with a cube, but that way won't work with e.g. a sphere (atleast I can't wrap my mind around it). The method he explained was to query each vtx of the cube and store the values, then query the position of each object, and if they were more than the cube's vtx min values and less than the max values, then select that object.
I can't say that I'm eager to get into the API stuff, I've had a quick look in the devkit/docs, and it seems pretty darn complicated 
Or maybe a tool like this already exists?