Computer identification of plane regions

Jozef Zámožík

Aplikace matematiky (1982)

  • Volume: 27, Issue: 3, page 209-222
  • ISSN: 0862-7940

Abstract

top
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.

How to cite

top

Zámožík, Jozef. "Computer identification of plane regions." Aplikace matematiky 27.3 (1982): 209-222. <http://eudml.org/doc/15240>.

@article{Zámožík1982,
abstract = {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.},
author = {Zámožík, Jozef},
journal = {Aplikace matematiky},
keywords = {computer grahics; image processing; simple algorithm for the identification of the inside and the outside of a plane bounded region; multiply connected regions; computer grahics; image processing; simple algorithm for the identification of the inside and the outside of a plane bounded region; multiply connected regions},
language = {eng},
number = {3},
pages = {209-222},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Computer identification of plane regions},
url = {http://eudml.org/doc/15240},
volume = {27},
year = {1982},
}

TY - JOUR
AU - Zámožík, Jozef
TI - Computer identification of plane regions
JO - Aplikace matematiky
PY - 1982
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 27
IS - 3
SP - 209
EP - 222
AB - 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.
LA - eng
KW - computer grahics; image processing; simple algorithm for the identification of the inside and the outside of a plane bounded region; multiply connected regions; computer grahics; image processing; simple algorithm for the identification of the inside and the outside of a plane bounded region; multiply connected regions
UR - http://eudml.org/doc/15240
ER -

References

top
  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. (1978) 
  2. M. Minsky, S. Papert, Perceptrons - an Introduction to Comupational Geometry, MIT Press, Cambridge, Mass, 1969. (1969) Zbl0197.43702
  3. D. Nitzan, G. J. Agin, 10.1016/0146-664X(79)90080-7, Computer Graphics and Image Processing 1 (1979), 22-39. (1979) DOI10.1016/0146-664X(79)90080-7
  4. A. Rosenfeld, Survey - Picture Processing: 1978, Computer graphics and Image Processing 4 (1979), 354-393. (1979) Zbl0634.68122MR0395387

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.