On a geometric problem of zigzags☆

https://doi.org/10.1016/S0020-0190(97)00042-2Get rights and content

Abstract

Using a topological argument, we give a simpler proof for the geometrical argument in the original proof of Isbell's ZigZag Theorem and an algorithm which effectively finds the required “zigzag” path. Both the proof and the algorithm remain valid for a more general form of the problem.

References (3)

There are more references available in the full text version of this article.

Cited by (2)

  • Walks on tilings of polygons

    2017, Theoretical Computer Science
    Citation Excerpt :

    That proof employed some surplus ‘inside information’ of the cells inherited from the algebraic problem setting in Isbell's paper. A rather simple topological proof was given in 1997 by the present authors together with Lucian Ilie in [3]. There also an algorithm for finding a good path was given.

  • Image Analysis and Computer Vision: 1997

    1998, Computer Vision and Image Understanding
☆

Research supported by the Academy of Finland, Project 137358.

∗

On leave of absence from Faculty of Mathematics, University of Bucharest, Str. Academiei 14, R-70109, Bucharest, Romania.

View full text
Copyright © 1997 Published by Elsevier B.V.