Anzeige
Erschienen in:
1998 | OriginalPaper | Buchkapitel
Boundary Tracking
verfasst von : Gabor T. Herman
Erschienen in: Geometry of Digital Spaces
Verlag: Birkhäuser Boston
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Now we are ready to start proving rigorously that boundary tracking algorithms perform exactly as they are intended to do. As an initial demonstration of this, we show that there is a “one-size-fits-all” algorithm which, given a binary picture over a finitary 1-simply connected digital space and a boundary face between a 1-spel and a 0-spel, will return the set of all boundary faces between the component of 1-spels containing the given 1-spel and the component of 0-spels containing the given 0-spel, provided only that this set is finite. We show that a proof of correctness of this algorithm is an immediate consequence of some the general results presented in the earlier chapters.