one idea here is to use distances in a kdtree… make your class A, and manually get the knearestdistance and when greated than too much for you, it should not be a?
excluding the whole world is not something I know how to do efficiently 
1 Like