Advertisement

On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees

  • Sheung-Hung Poon
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5092)

Abstract

We consider the problems of unfolding 3D lattice polygons embedded on the surface of some classes of lattice polyhedra, and of unfolding 2D orthogonal trees. During the unfolding process, all graph edges are preserved and no edge crossings are allowed. Let n be the number of edges of the given polygon or tree. We show that a lattice polygon embedded on an open lattice orthotube can be convexified in O(n) moves and time, and a lattice polygon embedded on a lattice Tower of Hanoi, a lattice Manhattan Tower, or an orthogonally-convex lattice polyhedron can be convexified in O(n 2) moves and time. The main technique in our algorithms is to fold up the lattice polygon from the end blocks of the given lattice polyhedron. On the other hand, we show that a 2-monotone orthogonal tree on the plane can be straightened in O(n 2) moves and time. We hope that our results shed some light on solving the more general conjectures, which we proposed, that a 3D lattice polygon embedded on any lattice polyhedron can always be convexified, and any 2D orthogonal tree can always be straightened.

Keywords

Tree Edge Edge Crossing Concave Corner Contact Graph Lattice Polygon 
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. 1.
    Alt, H., Knauer, C., Rote, G., Whitesides, S.: The Complexity of (Un)folding. In: Proc. of 19th ACM Symp. on Comput. Geom., pp. 164–170 (2003)Google Scholar
  2. 2.
    Biedl, T., Demaine, E., Demaine, M., Lazard, S., Lubiw, A., O’Rourke, J., Robbins, S., Streinu, I., Toussaint, G., Whitesides, S.: A Note on Reconfiguring Tree Linkages: Trees Can Lock. Disc. Appl. Math. 117(1-3), 293–297 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Biedl, T., Demaine, E., Demaine, M., Lazard, S., Lubiw, A., O’Rourke, J., Overmars, M., Robbins, S., Streinu, I., Toussaint, G., Whitesides, S.: Locked and Unlocked Polygonal Chains in Three Dimensions. Disc. & Comput. Geom. 26(3), 269–281 (2001)zbMATHGoogle Scholar
  4. 4.
    Cantarella, J., Demaine, E.D., Iben, H., O’Brien, J.: An Energy-Driven Approach to Linkage Unfolding. In: Proc. of 20th Ann. ACM Symp. on Comput. Geom., pp. 134–143 (2004)Google Scholar
  5. 5.
    Cocan, R., O’Rourke, J.: Polygonal Chains Cannot Lock in 4D. Comput. Geom.: Theory & Appl. 20, 105–129 (2001)zbMATHMathSciNetGoogle Scholar
  6. 6.
    Connelly, R., Demaine, E., Rote, G.: Infinitesimally Locked Self-Touching Linkages with Applications to Locked Trees. In: Physical Knots: Knotting, Linking, and Folding of Geometric Objects in R 3, American Mathematical Society, pp. 287–311 (2002)Google Scholar
  7. 7.
    Connelly, R., Demaine, E.D., Rote, G.: Straightening Polygonal Arcs and Convexifying Polygonal Cycles. Disc. & Comput. Geom. 30(2), 205–239 (2003)zbMATHMathSciNetGoogle Scholar
  8. 8.
    Damian, M., Flatland, R., Meijer, H., O’Rourke, J.: Unfolding Well-Separated Orthotrees. In: Proc. of 15th Ann. Fall Workshop on Comput. Geom., pp. 23–25 (2005)Google Scholar
  9. 9.
    Damian, M., Flatland, R., O’Rourke, J.: Unfolding Manhattan Towers. In: Proc. 17th Canadian Conference on Computational Geometry, pp. 211–214 (2005)Google Scholar
  10. 10.
    Dill, K.A.: Dominant Forces in Protein Folding. Biochemistry 29(31), 7133–7155 (1990)CrossRefGoogle Scholar
  11. 11.
    Hayes, B.: Prototeins. American Scientist 86, 216–221 (1998)CrossRefGoogle Scholar
  12. 12.
    Poon, S.-H.: On Straightening Low-Diameter Unit Trees. In: Proc. of 13th Int. Symp. on Graph Drawing, pp. 519–521 (2005)Google Scholar
  13. 13.
    Poon, S.-H.: On Unfolding Lattice Polygons/Trees and Diameter-4 Trees. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol. 4112, pp. 186–195. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  14. 14.
    Streinu, I.: A Combinatorial Approach for Planar Non-Colliding Robot Arm Motion Planning. In: Proc. of FOCS 2000, pp. 443–453 (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Sheung-Hung Poon
    • 1
  1. 1.Department of Computer ScienceNational Tsing Hua UniversityHsinchuTaiwan

Personalised recommendations