A programme to determine the exact interior of any connected digital picture
This solves a fundamental issue in computer graphics and image processing by providing a reliable method for region filling, though it appears incremental as it builds on existing concepts with a focus on correctness.
The paper tackles the problem of region filling in digital images, where existing Euclidean-based algorithms fail for degenerate cases, and presents a correct integer-only procedure that works for all connected digital pictures, finding all interior points.
Region filling is one of the most important and fundamental operations in computer graphics and image processing. Many filling algorithms and their implementations are based on the Euclidean geometry, which are then translated into computational models moving carelessly from the continuous to the finite discrete space of the computer. The consequences of this approach is that most implementations fail when tested for challenging degenerate and nearly degenerate regions. We present a correct integer-only procedure that works for all connected digital pictures. It finds all possible interior points, which are then displayed and stored in a locating matrix. Namely, we present a filling and locating procedure that can be used in computer graphics and image processing applications.