Something like this should be quite easy to realize using ScanLine algorithms as it will notify you when you reach a point "within".
It will also tell you the intersection point when it reaches it.
Using those data should enable you to easily drop the "within vertices" for the edge ones.
*I'm sure there are more efficient methods after all. But using Scanline is quite efficient and at least easy to understand what it does ^^*
It will also tell you the intersection point when it reaches it.
Using those data should enable you to easily drop the "within vertices" for the edge ones.
*I'm sure there are more efficient methods after all. But using Scanline is quite efficient and at least easy to understand what it does ^^*