Skip to main content
SpringerLink
Log in

An efficient algorithm determining when a fabric hangs together

  • Published:
Geometriae Dedicata Aims and scope Submit manuscript

Abstract

An algorithm of time complexity O(n) is given which determines whether a fabric hangs together, regardless of the number of directions of its strands.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Bibliography

  1. Aho, A., Hopcroft, J., and Ullman, J.: The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.

  2. Clapham, C. R. J.: ‘When a Fabric Hangs Together’. Bull. London Math. Soc. 12 (1980), 161–164.

    Google Scholar 

  3. Grunbaum, B. and Shephard, G. C.: ‘An Introduction to the Geometry of Fabrics’. Math. Mag. 53 (1980), 139–161.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mesa College, Room A109, 720 Mesa College Drive, 92037, San Diego, CA, U.S.A.

    T. C. Enns

Authors
  1. T. C. Enns
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Enns, T.C. An efficient algorithm determining when a fabric hangs together. Geom Dedicata 15, 259–260 (1984). https://doi.org/10.1007/BF00147648

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00147648

Keywords

Search

Navigation