On Inducing Polygons and Related Problems

  • Eyal Ackerman
  • Rom Pinchasi
  • Ludmila Scharf
  • Marc Scherfenberg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5757)

Abstract

Bose et al. [1] asked whether for every simple arrangement \(\mathcal{A}\) of n lines in the plane there exists a simple n-gon P that induces\(\mathcal{A}\) by extending every edge of P into a line. We prove that such a polygon always exists and can be found in O(n logn) time. In fact, we show that every finite family of curves \(\mathcal{C}\) such that every two curves intersect at least once and finitely many times and no three curves intersect at a single point possesses the following Hamiltonian-type property: the union of the curves in \(\mathcal{C}\) contains a simple cycle that visits every curve in \(\mathcal{C}\) exactly once.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bose, P., Everett, H., Wismath, S.: Properties of arrangement graphs. Int. J. Comput. Geom. Appl. 13, 447–462 (2003)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry, 3rd edn. Springer, Berlin (2008)CrossRefMATHGoogle Scholar
  3. 3.
    Ching, Y.T., Lee, D.T.: Finding the diameter of a set of lines. Pattern Recognition 18(3–4), 249–255 (1985)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Felsner, S.: Geometric Graphs and Arrangements. Some Chapters from Combinatorial Geometry. Advanced Lectures in Mathematics. Friedr. Vieweg & Sohn, Wiesbaden (2004)CrossRefMATHGoogle Scholar
  5. 5.
    Grünbaum, B.: Arrangements and spreads. In: Conference Board of the Mathematical Sciences Regional Conference Series in Mathematics, vol. 10. American Mathematical Society, Providence (1972)Google Scholar
  6. 6.
    Hershberger, J., Suri, S.: Applications of a semi-dynamic convex hull algorithm. BIT 32(2), 249–267 (1992)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Perlstein, A.: Problems in Combinatorial Geometry, Ph.D. Thesis, Mathematics Department, Technion—Israel Institute of Technology (2008)Google Scholar
  8. 8.
    Scharf, L., Scherfenberg, M.: Inducing polygons of line arrangements. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 507–519. Springer, Heidelberg (2008)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Eyal Ackerman
    • 1
  • Rom Pinchasi
    • 2
  • Ludmila Scharf
    • 1
  • Marc Scherfenberg
    • 1
  1. 1.Institute of Computer ScienceFreie Universität BerlinBerlinGermany
  2. 2.Mathematics DepartmentTechnion—Israel Institute of TechnologyHaifaIsrael

Personalised recommendations