It's T12 or L1, isnt it? First collect points with

flood fill. Of course there is danger that an area

will be united with an unwanted one that should

not be removed.

Big areas are statistical outliers in the set

of set of points.

The area to be eliminated is a convex polygon,

so from each point that belongs to it

a line can be drawn to the majority of

other points in the set without crossing

the outside.

Regards,

Joachim

how to connect points with floodfill.can you write pseudocode

Here's an algorithm using a stack.

Many OOP frameworks have a ready-made

stack class, but it's easy to write one

by yourself. It is sometimes a good idea

to deallocate points not to the heap but

to a dedicated list, and to allocate

points preferably from that list.

https://en.wikipedia.org/wiki/Flood_fill#Alternative_implementations

A little bit more complicated is to

collect points along a line. You could

first divide the distance vector by

say the width or height of the image

and the proceed in directional vectors

of that length from the starting point to

the end, but that's not the fastest method.

Bresenham is better but a little bit more

complicated to program, since Bresenham

is only defined for an eighth of the plane.

Regards,

Joachim