, e I) 4-Create-Edge (R / , R)

L. ,

, R 4--Create-VertexO

~. ,

L. ,

. L-remove, Cur~'en~ (L)

, Current (L) +-Prede cessor (Current (L))

, Implementation of precodes (6) and (7), el .Current(L)

, e2 .Following (Current (L)

, ~(e2) ~el then Unify-Contour(el,e2)

. L-remove,

. L-replaee, G(Cu~.ent(L))

, Current(L)+-Following(Current(L))

. L-replace, r Current(L)+-Following

, ) and (5) el --Current(L)

, e2 .Following(Current(L)

, e2) ~el then L Unify-Contour, p.2

. L-remove, , vol.2

, RI

~. ,

~. ,

, L-Insert

. Current, Current(L)

, el .Current(L)

, Current(L), p.2

, lif ~(e2)~el then Unify-Contour(el,e2)

. Il-remove, , vol.2

, I R+-Create-Vertex(

, e~)+-Create-Edge(R, vol.3

E. Ahronovitz, J. Aubert, and C. Fiorio, The startopology: a topology for image analysis, th Discrete Geometry for Computer Imagery, Proceedings, pp.107-116, 1995.
URL : https://hal.archives-ouvertes.fr/lirmm-01168307

Y. Bertrand, J. Dufourd, J. Fran~on, and P. Lienhardt, Mod4lisation volumique & base topologique. Rapport de recherche 92/16, vol.7, p.67094

F. Strasbourg, , 1992.

L. T. Roger and . Cederberg, Philippe Charnier. Outils algorithmiques pour le codage interpixel et ses applications, Computer Graphics and Image Process, vol.10, pp.224-234, 1979.

R. Cori, Un code pour les graphes planaires et ses applications, Ast4risque, 1975.

J. Dufourd, Formal specification of topological subdivisions using hypermaps, Computer-Aided Design, vol.23, issue.2, pp.99-116, 1991.

J. Edmonds, A combinatorial representation for polyhedral surfaces. Notices of the, vol.7, 1960.

C. Fiorio and J. Gustedt, Christophe Fiorio. Approche interpixel en analyse d'images : une topologie et des algorithmes de segmentation, Theoretical Computer Science, vol.154, pp.165-181, 1995.

H. Freeman, On the encoding of arbitrary geometric configurations, IEEE trans. Elec. Computers, vol.10, 1961.

M. Gangnet, J. Herv4, T. Pudet, and J. Van-thong, Incremental computation of planar maps, vol.5, 1989.

A. Jacques-;-efim, R. Khalimsky, P. R. Kopperman, and . Meyer, Computer graphics and connected topologies on finite ordered sets, Constellations et graphes topologiques. In Combinatorial Theory and Applications, vol.3, pp.1-17, 1970.

G. Walter, H. Kropatsch, and . Macho, Finding the structure of connected components using dual irregular pyramids, th Discrete Geometry for Computer Imagery, Proceedings, pp.147-158, 1995.

V. A. Kovalevsky, Finite topology as applied to image analysis. Computer Vision, Graphics, and Image Processing, vol.46, pp.141-161, 1989.

G. Walter and . Kropatsch, Building irregular pyramids by dual graph contraction, Dept. for Pattern Recognition and Image Processing, 1994.

P. Lienhardt, Subdivision of n-dimensional spaces and n-dimensional generalized maps, th ACM Conf. Comput. Geometry, pp.228-236, 1989.

P. Lienhardt, Topological models for boundary representation: A survey, Comput. Aided Design, vol.23, issue.1, pp.59-81, 1991.

A. Montanvert, P. Meet, and A. Rosenfeld, Hierarchichal image analysis using irregular tessalations, IEEE trans. Pattern Analysis and Machine Intelligence, vol.13, issue.4, pp.307-316, 1991.

T. Pavlidis, Azriel Rosenfeld. Adjacency in digital pictures, Structural Pattern Recognition, vol.26, pp.24-33, 1974.

G. Vosselman, Relational Matching, Lecture Notes in Computer Science, 1992.