Abstract
We study the problem of encoding homotopy of simple paths in the plane. We show that the homotopy of a simple path with k edges in the presence of n obstacles can be encoded using O(n log(n + k)) bits. The bound is tight if k=Ω(n 1 + ε). We present an efficient algorithm for encoding the homotopy of a path. The algorithm can be applied to find homotopic paths among a set of simple paths. We show that the homotopy of a general (not necessary simple) path can be encoded using O(k logn) bits. The bound is tight. The code is based on a homotopic minimum-link path and we present output-sensitive algorithms for computing a path and the code.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bar-Yehuda, R., Chazelle, B.: Triangulating disjoint Jordan chains. Internat. J. Comput. Geom. Appl. 4(4), 475–481 (1994)
Bespamyatnikh, S.: Computing homotopic shortest paths in the plane. J. Algorithms 49(2), 284–303 (2003)
Cabello, S., Liu, Y., Mantler, A., Snoeyink, J.: Testing homotopy for paths in the plane. In: Proc. 18th Annu. ACM Sympos. Comput. Geom., pp. 160–169 (2002)
Chazelle, B.: A theorem on polygon cutting with applications. In: Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci., pp. 339–349 (1982)
Chazelle, B.: An algorithm for segment-dragging and its implementation. Algorithmica 3, 205–221 (1988)
Efrat, A., Kobourov, S.G., Lubiw, A.: Computing homotopic shortest paths efficiently. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 411–423. Springer, Heidelberg (2002)
Ghosh, S.K.: Computing visibility polygon from a convex set and related problems. J. Algorithms 12, 75–95 (1991)
Hershberger, J., Snoeyink, J.: Computing minimum length paths of a given homotopy class. Comput. Geom. Theory Appl. 4, 63–98 (1994)
Keeler, K., Westbrook, J.: Short encodings of planar graphs and maps. Discrete Applied Mathematics 58(3), 239–252 (1995)
Lee, D.T., Preparata, F.P.: Euclidean shortest paths in the presence of rectilinear barriers. Networks 14, 393–410 (1984)
Matoušek, J.: Range searching with efficient hierarchical cuttings. Discrete Comput. Geom. 10(2), 157–182 (1993)
Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 633–701. Elsevier Science Publishers B.V. North-Holland, Amsterdam (2000)
Ian Munro, J., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J. Comput. 31(3), 762–776 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bespamyatnikh, S. (2004). Encoding Homotopy of Paths in the Plane. In: Farach-Colton, M. (eds) LATIN 2004: Theoretical Informatics. LATIN 2004. Lecture Notes in Computer Science, vol 2976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24698-5_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-24698-5_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21258-4
Online ISBN: 978-3-540-24698-5
eBook Packages: Springer Book Archive