Contour codes of isothetic polygons

Abstract An isothetic polygonal arc is one that has all its sides oriented in two orthogonal directions, so that all its angles are right angles. Such an arc is determined (up to congruence) by specifying a “code” sequence of the form α 1 A 1 α 2 … α m −1 A m −1 α m , where the α's are positive real numbers representing side lengths, and the A 's are single bits that specify whether the arc turns left or right between one side and the next. In this paper we develop basic properties of this code and show how to derive various geometric properties of the arc (or the region it bounds, if it is closed) directly from the code.

[1]  Hanan Samet,et al.  Region representation: quadtrees from boundary codes , 1980, CACM.

[2]  Jack Sklansky,et al.  Minimal rectangular partitions of digitized blobs , 1984, Comput. Vis. Graph. Image Process..

[3]  Herbert Freeman,et al.  Computer Processing of Line-Drawing Images , 1974, CSUR.

[4]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[5]  Sartaj Sahni,et al.  Fast algorithm for polygon decomposition , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Azriel Rosenfeld,et al.  Region representation: boundary codes from quadtrees , 1980, CACM.

[7]  Azriel Rosenfeld,et al.  Parallel Computation of Contour Properties , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Azriel Rosenfeld,et al.  Digital Picture Processing , 1976 .

[9]  Azriel Rosenfeld,et al.  Parallel processing of region boundaries , 1989, Pattern Recognit..