Find them without any additional interaction? How would then this "needle point" be known? I maybe misunderstood first post, because for this "needle point" method you need to define that point
It could be done using this great intersection functions by Lee Mac, https://www.lee-mac.com/intersectionfunctions.html#intersectionsinset, it could be made to work with hatches. But if you found the working solution use that of course.

How about you ssget all hatches, then test if point (a needle) is inside a hatch, if yes add it to new selection set

Thanks for that info Phil. Do appreciate your input.

Thanks Gile, I was trying to remove a corrupt scale with the name of 1:1000 and at a ratio of 1:1 and your code was the only one that removed it and kept remaining objects and their scale intact.  See the attached file for your reference.

How do I call the function to create the scale list after purging?

I've tried:
(setq lst '(("20:1" 20 1)
            ("10:1" 10 1)
            ("5:1" 5 1)
            ("2:1" 2 1)
            ("1:1" 1 1)
            ("1:2" 1 2)
            ("1:5" 1 5)
            ("1:10" 1 10)
            ("1:20" 1 20)
            ("1:25" 1 25)
            ("1:50" 1 50)
            ("1:75" 1 75)
            ("1:100" 1 100)
            ("1:200" 1 200)
            ("1:250" 1 250)
            ("1:400" 1 400)
            ("1:500" 1 500)
            ("1:1000" 1 1000)
            ("1:1250" 1 1250)
            ("1:2500" 1 2500)
            ("1:5000" 1 5000)
           )
) ;_ end of setq

(SetScaleList lst)
I get the error:
error: bad argument type: lentityp nil