Previous |  Up |  Next

Article

Title: Computer identification of plane regions (English)
Author: Zámožík, Jozef
Language: English
Journal: Aplikace matematiky
ISSN: 0373-6725
Volume: 27
Issue: 3
Year: 1982
Pages: 209-222
Summary lang: English
Summary lang: Slovak
Summary lang: Russian
.
Category: math
.
Summary: 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. (English)
Keyword: computer grahics
Keyword: image processing
Keyword: simple algorithm for the identification of the inside and the outside of a plane bounded region
Keyword: multiply connected regions
MSC: 51-04
MSC: 68G99
MSC: 68U99
idZBL: Zbl 0483.68086
idMR: MR0658003
DOI: 10.21136/AM.1982.103963
.
Date available: 2008-05-20T18:19:16Z
Last updated: 2020-07-28
Stable URL: http://hdl.handle.net/10338.dmlcz/103963
.
Reference: [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.
Reference: [2] M. Minsky, S. Papert: Perceptrons - an Introduction to Comupational Geometry.MIT Press, Cambridge, Mass, 1969.
Reference: [3] D. Nitzan, G. J. Agin: Fast Methods for Finding Object Outlines.Computer Graphics and Image Processing 1 (1979), 22-39. 10.1016/0146-664X(79)90080-7
Reference: [4] A. Rosenfeld: Survey - Picture Processing: 1978.Computer graphics and Image Processing 4 (1979), 354-393. MR 0395387
.

Files

Files Size Format View
AplMat_27-1982-3_6.pdf 2.224Mb application/pdf View/Open
Back to standard record
Partner of
EuDML logo