Previous |  Up |  Next


computer grahics; image processing; simple algorithm for the identification of the inside and the outside of a plane bounded region; multiply connected regions
This paper gives a simple algorithm for the identification of the insidedness and the autsidedness of a plane bounded region. The region can be the union, intersection or difference of an arbitrary number of $k$-tuple connected regions.
[1] P. Lemkin: The Run Length Map: A Representation of Contours and Regions for Efficient Search & Low Level Semantic Encoding. Соmр. Science Technical Report Series, Univ. of Maryland, Apr. 1978.
[2] M. Minsky, S. Papert: Perceptrons - an Introduction to Comupational Geometry. MIT Press, Cambridge, Mass, 1969.
[3] D. Nitzan, G. J. Agin: Fast Methods for Finding Object Outlines. Computer Graphics and Image Processing 1 (1979), 22-39. DOI 10.1016/0146-664X(79)90080-7
[4] A. Rosenfeld: Survey - Picture Processing: 1978. Computer graphics and Image Processing 4 (1979), 354-393. MR 0395387
Partner of
EuDML logo