Pointed Binary Encompassing Trees

  • Michael Hoffmann
  • Bettina Speckmann
  • Csaba D. Tóth
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3111)

Abstract

We show that for any set of disjoint line segments in the plane there exists a pointed binary encompassing treeT, that is, a spanning tree on the segment endpoints that contains all input segments, has maximum degree three, and every vertex vT is pointed, that is, v has an incident angle greater than π. Such a tree can be completed to a minimum pseudo-triangulation. In particular, it follows that every set of disjoint line segments has a minimum pseudo-triangulation of bounded vertex degree.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agarwal, P.K., Basch, J., Guibas, L.J., Hershberger, J., Zhang, L.: Deformable free space tilings for kinetic collision detection. In: Proc. 4th WAFR, pp. 83–96 (2001)Google Scholar
  2. 2.
    Aichholzer, O., Hoffmann, M., Speckmann, B.: Degree bounds for constrained pseudo-triangulations. In: Proc. 15th CCCG, pp. 155–158 (2003)Google Scholar
  3. 3.
    Aichholzer, O., Huemer, C., Krasser, H.: Triangulations without pointed spanning trees. In: Abstracts of 20th European Workshop Comput. Geom. (2004)Google Scholar
  4. 4.
    Bespamyatnikh, S.: Computing homotopic shortest paths in the plane. J. Algorithms 49, 284–303 (2003)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Bose, P., Houle, M.E., Toussaint, G.T.: Every set of disjoint line segments admits a binary tree. Discrete Comput Geom. 26, 387–410 (2001)MATHMathSciNetGoogle Scholar
  6. 6.
    Bose, P., Toussaint, G.T.: Growing a tree from its branches. J. Algorithms 19, 86–103 (1995)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Chazelle, B., Edelsbrunner, H., Grigni, M., Guibas, L.J., Hershberger, J., Sharir, M., Snoeyink, J.: Ray shooting in polygons using geodesic triangulations. Algorithmica 12, 54–68 (1994)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Cheng, S.-W., Janardan, R.: New results on dynamic planar point location. SIAM J. Comput. 21, 972–999 (1992)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Efrat, A., Kobourov, S., 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)CrossRefGoogle Scholar
  10. 10.
    Goodrich, M., Tamassia, R.: Dynamic ray shooting and shortest paths in planar subdivision via balanced geodesic triangulations. J. Algorithms 23, 51–73 (1997)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Hoffmann, M., Tóth, C.D.: Alternating paths through disjoint line segments. Inform. Proc. Letts. 87, 287–294 (2003)MATHCrossRefGoogle Scholar
  12. 12.
    Hoffmann, M., Tóth, C.D.: Segment endpoint visibility graphs are Hamiltonian. Comput. Geom. Theory Appl. 26, 47–68 (2003)MATHGoogle Scholar
  13. 13.
    Kettner, L., Kirkpatrick, D., Mantler, A., Snoeyink, J., Speckmann, B., Takeuchi, F.: Tight degree bounds for pseudo-triangulations of points. Comput. Geom. Theory Appl. 25, 1–12 (2003)MathSciNetGoogle Scholar
  14. 14.
    Kirkpatrick, D., Speckmann, B.: Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons. In: Proc. 18th Sympos. Comput. Geom., pp. 179–188. ACM, New York (2002)Google Scholar
  15. 15.
    Pocchiola, M., Vegter, G.: Minimal tangent visibility graphs. Comput. Geom.Theory Appl. 6, 303–314 (1996)MATHMathSciNetGoogle Scholar
  16. 16.
    Pocchiola, M., Vegter, G.: Topologically sweeping visibility complexes via pseudo-triangulations. Discrete Comput. Geom. 16, 419–453 (1996)MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Rappaport, D.: Computing simple circuits from a set of line segments is NPcomplete. SIAM J. Comput. 18, 1128–1139 (1989)MATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Speckmann, B., Tóth, C.D.: Allocating vertex π-guards in simple polygons via pseudo-triangulations. In: Proc. 14th SODA, pp. 109–118. ACM Press, New York (2003)Google Scholar
  19. 19.
    Streinu, I.: A combinatorial approach to planar non-colliding robot arm motion planning. In: Proc. 41st FOCS, pp. 443–453. IEEE Press, Los Alamitos (2000)Google Scholar
  20. 20.
    Tóth, C.D.: Alternating paths along orthogonal segments. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 389–400. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  21. 21.
    Urabe, M., Watanabe, M.: On a counterexample to a conjecture of Mirzaian, Comput. Geom. Theory Appl. 2, 51–53 (1992)MATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Michael Hoffmann
    • 1
  • Bettina Speckmann
    • 2
  • Csaba D. Tóth
    • 3
  1. 1.Institute of Theoretical Computer ScienceETH Zürich 
  2. 2.Department of Mathematics and Computer ScienceTU Eindhoven 
  3. 3.Department of Computer ScienceUniversity of California at Santa Barbara 

Personalised recommendations