Skip to main content
SpringerLink
Log in

Arrangements in Geometry: Recent Advances and Challenges

  • Conference paper
Algorithms – ESA 2007 (ESA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4698))

Included in the following conference series:

  • 1736 Accesses

Abstract

We review recent progress in the study of arrangements in computational and combinatorial geometry, and discuss several open problems and areas for further research.

Work on this paper was partially supported by NSF Grant CCF-05-14079, by a grant from the U.S.-Israeli Binational Science Foundation, by grant 155/05 from the Israel Science Fund, Israeli Academy of Sciences, and by the Hermann Minkowski–MINERVA Center for Geometry at Tel Aviv University.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agarwal, P.K., Gao, J., Guibas, L., Koltun, V., Sharir, M.: Stable Delaunay graphs, unpublished manuscript (2007)

    Google Scholar 

  2. Agarwal, P.K., Nevo, E., Pach, J., Pinchasi, R., Sharir, M., Smorodinsky, S.: Lenses in arrangements of pseudocircles and their applications. J. ACM 51, 13–186 (2004)

    Google Scholar 

  3. Agarwal, P.K., Pach, J., Sharir, M.: State of the union, of geometric objects: A review. In: Proc. Joint Summer Research Conference on Discrete and Computational Geometry—Twenty Years later, Contemp. Math, AMS, Providence, RI (to appear)

    Google Scholar 

  4. Agarwal, P.K., Sharir, M.: Efficient algorithms for geometric optimization. ACM Computing Surveys 30, 412–458 (1998)

    Article  Google Scholar 

  5. Agarwal, P.K., Sharir, M.: Davenport-Schinzel sequences and their geometric applications. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 1–47. North-Holland, Amsterdam (2000)

    Google Scholar 

  6. Agarwal, P.K., Sharir, M.: Arrangements of surfaces in higher dimensions. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 49–119. North-Holland, Amsterdam (2000)

    Google Scholar 

  7. Agarwal, P.K., Sharir, M.: Pseudoline arrangements: Duality, algorithms and applications. SIAM J. Comput. 34, 526–552 (2005)

    Article  MATH  Google Scholar 

  8. Aronov, B., Sharir, M.: Cutting circles into pseudo-segments and improved bounds for incidences. Discrete Comput. Geom. 28, 475–490 (2002)

    MATH  Google Scholar 

  9. Aurenhammer, F., Klein, R.: Voronoi diagrams. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 201–290. Elsevier Science, Amsterdam (2000)

    Google Scholar 

  10. Boissonnat, J.-D., Sharir, M., Tagansky, B., Yvinec, M.: Voronoi diagrams in higher dimensions under certain polyhedral distance functions. Discrete Comput. Geom. 19, 485–519 (1998)

    Article  MATH  Google Scholar 

  11. Braß, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer, New York (2005)

    MATH  Google Scholar 

  12. Chan, T.M.: On levels in arrangements of curves. Discrete Comput. Geom. 29, 375–393 (2003)

    MATH  Google Scholar 

  13. Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M.: A singly exponential stratification scheme for real semi–algebraic varieties and its applications. Theoretical Computer Science 84, 77–105 (1991) (Also in Proc. 16th Int. Colloq. on Automata, Languages and Programming, pp. 179–193 (1989))

    Article  MATH  Google Scholar 

  14. Chew, L.P., Kedem, K., Sharir, M., Tagansky, B., Welzl, E.: Voronoi diagrams of lines in three dimensions under polyhedral convex distance functions. J. Algorithms 29, 238–255 (1998)

    Article  MATH  Google Scholar 

  15. Clarkson, K., Edelsbrunner, H., Guibas, L., Sharir, M., Welzl, E.: Combinatorial complexity bounds for arrangements of curves and spheres. Discrete Comput. Geom. 5, 99–160 (1990)

    Article  MATH  Google Scholar 

  16. Dey, T.K.: Improved bounds for planar k-sets and related problems. Discrete Comput. Geom. 19, 373–382 (1998)

    Article  MATH  Google Scholar 

  17. Edelsbrunner, H.: Algorithms in Combinatorial Geometry. Springer, Berlin (1987)

    MATH  Google Scholar 

  18. Edelsbrunner, H., Seidel, R.: Voronoi diagrams and arrangements. Discrete Comput. Geom. 1, 25–44 (1986)

    Article  MATH  Google Scholar 

  19. Erdös, P.: On sets of distances of n points. American Mathematical Monthly 53, 248–250 (1946)

    Article  MATH  Google Scholar 

  20. Erdös, P., Lovász, L., Simmons, A., Straus, E.G.: Dissection graphs of planar point sets. In: Srivastava, J.N., et al. (eds.) A Survey of Combinatorial Theory, pp. 139–149. North-Holland, Amsterdam (1973)

    Google Scholar 

  21. Ezra, E., Sharir, M.: Almost tight bound for the union of fat tetrahedra in three dimensions. In: Proc. 48th Annu. IEEE Sympos. Foundat. Vomput. Sci (to appear, 2007)

    Google Scholar 

  22. Kedem, K., Livne, R., Pach, J., Sharir, M.: On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete Comput. Geom. 1, 59–71 (1986)

    Article  MATH  Google Scholar 

  23. Koltun, V.: Almost tight upper bounds for vertical decomposition in four dimensions. J. ACM 51, 699–730 (2004)

    Article  Google Scholar 

  24. Koltun, V., Sharir, M.: Three-dimensional Euclidean Voronoi diagrams of lines with a fixed number of orientations. SIAM J. Comput. 32, 616–642 (2003)

    Article  MATH  Google Scholar 

  25. Koltun, V., Sharir, M.: The partition technique for the overlay of envelopes. SIAM J. Comput. 32, 841–863 (2003)

    Article  MATH  Google Scholar 

  26. Koltun, V., Sharir, M.: Polyhedral Voronoi diagrams of polyhedra in three dimensions. Discrete Comput. Geom. 31, 83–124 (2004)

    MATH  Google Scholar 

  27. Lovász, L.: On the number of halving lines. Ann. Univ. Sci. Budapest, Eötvös, Sec. Math. 14, 107–108 (1971)

    Google Scholar 

  28. Matoušek, J.: Lectures on Discrete Geometry. Springer, Heidelberg (2002)

    Google Scholar 

  29. Matoušek, J., Sharir, M., Smorodinsky, S., Wagner, U.: On k-sets in four dimensions. Discrete Comput. Geom. 35, 177–191 (2006)

    Article  Google Scholar 

  30. Nivasch, G.: An improved, simple construction of many halving edges. In: Proc. Joint Summer Research Conference on Discrete and Computational Geometry—Twenty Years later, Contemp. Math, AMS, Providence, RI (to appear)

    Google Scholar 

  31. Pach, J.: Finite point configurations. In: O’Rourke, J., Goodman, J. (eds.) Handbook of Discrete and Computational Geometry, pp. 3–18. CRC Press, Boca Raton, FL (1997)

    Google Scholar 

  32. Pach, J., Agarwal, P.K.: Combinatorial Geometry. Wiley, New York (1995)

    MATH  Google Scholar 

  33. Pach, J., Sharir, M.: Geometric incidences. In: Pach, J. (ed.) Towards a Theory of Geometric Graphs Contemporary Mathematics, Amer. Math. Soc., Providence, RI, vol. 342, pp. 185–223 (2004)

    Google Scholar 

  34. Sharir, M.: Arrangements of surfaces in higher dimensions, in Advances in Discrete and Computational Geometry. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Proc. 1996 AMS Mt. Holyoke Summer Research Conference, Contemporary Mathematics No. 223, American Mathematical Society, pp. 335–353 (1999)

    Google Scholar 

  35. Sharir, M., Agarwal, P.K.: Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, Cambridge-New York-Melbourne (1995)

    MATH  Google Scholar 

  36. Sharir, M., Smorodinsky, S., Tardos, G.: An improved bound for k-sets in three dimensions. Discrete Comput. Geom. 26, 195–204 (2001)

    MATH  Google Scholar 

  37. Steiner, J.: Einige Gesetze über die Theilung der Ebene und des Raumes, J. Reine Angew. Math. 1, 349–364 (1826)

    Google Scholar 

  38. Székely, L.: Crossing numbers and hard Erdös problems in discrete geometry. Combinatorics, Probability and Computing 6, 353–358 (1997)

    Article  MATH  Google Scholar 

  39. Szemerédi, E., Trotter, W.T.: Extremal problems in discrete geometry. Combinatorica 3, 381–392 (1983)

    Article  MATH  Google Scholar 

  40. Tamaki, H., Tokuyama, T.: How to cut pseudo-parabolas into segments. Discrete Comput. Geom. 19, 265–290 (1998)

    Article  MATH  Google Scholar 

  41. Tóth, G.: Point sets with many k-sets. Discrete Comput. Geom. 26, 187–194 (2001)

    MATH  Google Scholar 

  42. Wagner, U.: k-Sets and k-facets, manuscript (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Tel Aviv University, Tel Aviv, Israel

    Micha Sharir

Authors
  1. Micha Sharir
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lars Arge Michael Hoffmann Emo Welzl

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sharir, M. (2007). Arrangements in Geometry: Recent Advances and Challenges. In: Arge, L., Hoffmann, M., Welzl, E. (eds) Algorithms – ESA 2007. ESA 2007. Lecture Notes in Computer Science, vol 4698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75520-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75520-3_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75519-7

  • Online ISBN: 978-3-540-75520-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation