Sufficiently Near Neighbourhoods of Points in Flow Graphs. A Near Set Approach
James Francis Peters, Doungrat Chitcharoen · Fundamenta Informaticae · 2013
This paper introduces sufficiently near visual neighbourhoods of points and neighbourhoods of sets in digital image flow graphs (NDIFGs). An NDIFG is an extension of a Pawlak flow graph. The study of sufficiently near neighbourhoods in NDIFGs stems f