Advertisement

Disassembling two-dimensional composite parts via translations

  • Doron Nussbaum
  • Jörg-R. Sack
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 401)

Abstract

This paper deals with the computational complexity of disassembling 2-dimensional composite parts (comprised of simple polygons) via collision-free translations. The first result of this paper is an O(Mn + M log M) algorithm for computing a sequence of translations (performed in a common direction) to disassemble composite parts. The algorithm improves on the O(Mn log Mn) bound previously established for this problem and is easily seen to be optimal. The algorithm solves the problem posed by Nurmi and by Toussaint.

The second result of this paper is an Ω(Mn + M log M) lower bound proof for the problem of detecting whether a composite part can be disassembled, or contains interlocking subparts. Thus, detecting the existence of a disassembly sequence is as hard as computing one. As a consequence, the algorithm for computing a disassembly sequence is optimal also for the detecting problem.

Keywords

Convex Polygon Linear Extension Composite Part Simple Polygon Visibility Hull 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [CD]
    B. Chazelle and D.P. Dobkin, "Intersection of Convex Objects in Two and Three Dimensions", Journal of the ACM, Vol. 34, No. 1, January 1987, pp. 1–27.CrossRefGoogle Scholar
  2. [COSW]
    B. Chazelle, T. Ottmann, E. Soisalon-Soininen and D. Wood, "The Complexity and Decidability of Separation", Technical Report no. CS-83-34, University of Waterloo, Waterloo, Ontario, November 1983.Google Scholar
  3. [D]
    R. Dawson, "On Removing a Ball Without Disturbing the Others", Mathematics Magazine, Vol. 57, No. 1, January 1984, pp. 27–30.Google Scholar
  4. [DSa]
    J. Dean and J.-R. Sack, "Efficient Hidden-Line Elimination by Capturing Winding Information", Proceedings 23rd Allerton Conference on Communication, Control and Computing, Ill., Oct. 1985, pp. 496–505.Google Scholar
  5. [DS]
    F. Dehne and J.-R. Sack, "Translation Separability of Sets of Polygons", The Visual Computer, No. 3, 1981, pp. 227–235.Google Scholar
  6. [EA]
    H. ElGindy, D. Avis, "A Linear Algorithm for Computing the Visibility Polygon from a Point", Journal of Algorithms, Vol. 2, No. 3, 1983, pp. 191–202.Google Scholar
  7. [GY]
    L. J. Guibas and F. F. Yao, "On Translating a Set of Rectangles", in Advances in Computing Research Volume I: Computational Geometry, Ed. F.P. Preparata, JAI Press Inc., Greenwich, CO, 1983, pp. 61–77.Google Scholar
  8. [L]
    D.T. Lee, "Visibility of a Simple Polygon", Computer Vision, Graphics and Image Processing, Vol. 22, No. 2, 1983, pp. 207–221.Google Scholar
  9. [N]
    O. Nurmi, "On Translating a Set of Objects in 2-and 3-Dimensional Space", Computer Vision, Graphics, and Image Processing, Vol. 36, 1986, pp. 42–52.Google Scholar
  10. [NS]
    O. Nurmi and J.-R. Sack, "Separating a Polyhedron by One Translation from a Set of Obstacles", Proceedings Workshop on Graph Theory, Amsterdam 1988, Lecture Notes in Computer Science, Vol. 344, 1988, pp. 202–212.Google Scholar
  11. [Na]
    B. K. Natarajan, "On Planning Assemblies", Proceedings of the Fourth Annual Symposium on Computational Geometry, Urbana-Champaign, Illinois, June 1988, pp. 299–308.Google Scholar
  12. [Nu]
    D. Nussbaum, "Directional Separability in two and three Dimensional Space", School of Computer Science, Carleton University, 1988.Google Scholar
  13. [OW]
    T. Ottmann and P. Widmayer, "On Translating a Set of Line Segments", Computer Vision, Graphics, and Image Processing Vol. 24, 1983, pp. 382–389.Google Scholar
  14. [PS]
    F. P. Preparata and M. I. Shamos, Computational Geometry An Introduction, Springer-Verlag, Berlin, Heidelberg, New York, Tokyo, 1985.Google Scholar
  15. [R]
    J. Reif, "Complexity of the Mover's Problem and Generalizations", Proceedings 20th Symposium on the Foundations of Computer Science, 1979, pp. 560–570.Google Scholar
  16. [PSS]
    R. Pollack, M. Sharir and S. Sifrony, "Separating Two Simple Polygons by a Sequence of Translations", Technical Report No. 59/87, Eskenasy Institute of Computer Science, School of Mathematical Science, Tel-Aviv University, Tel-Aviv Israel, January 1987.Google Scholar
  17. [ST]
    J.-R. Sack and G.T. Toussaint, "Separability of Pairs of Polygons Through Single Translations", Robotica, Vol. 5, 1987, pp. 55–63.Google Scholar
  18. [T]
    G. T. Toussaint, "Movable Separability of Sets", Computational Geometry Ed. G. T. Toussaint, North Holland Amsterdam, New York, Oxford, 1985.Google Scholar
  19. [Ta]
    R. E. Tarjan, "Depth First Search and Linear Graph Algorithms", SIAM Journal on Computing, Vol. 1, 1972, pp. 146–160.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Doron Nussbaum
    • 1
  • Jörg-R. Sack
    • 2
  1. 1.Tydac Technologies Inc.Ottawa
  2. 2.School of Computer ScienceCarleton UniversityOttawaCanada

Personalised recommendations