hi, as in topic
how to find points that belongs to more than 2 primitives?
trying to google something but cant find answer, and i guess it should be quite simple,

edit:
guess neighbourcount is the answer

thanks

Probably better and safer to use the pointprims() function, that returns an array of the primitives associated with the iterating point.
Then you can check the len() of the array to get the number of prims.

I think neighbourcount can lead you to some issue, but this is just guess because I don't know what kind of geometry you are checking