Skip to main content
SpringerLink
Log in

Computing shortest transversals

  • Computational Geometry (Session 16)
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 510))

Included in the following conference series:

  • 139 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

8. References

  1. Atallah, M. J. and Bajaj, C., “Efficient algorithms for common transversals,” Information Processing Letters, vol. 25, May 1987, pp.87–91.

    Google Scholar 

  2. Avis, D. and Doskas, M., “Algorithms for high dimensional stabbing problems,” Discrete and Applied Mathematics, to appear in 1990.

    Google Scholar 

  3. Avis, D., Gum, T., and Toussaint, G. T., “Visibility between two edges of a simple polygon,” The Visual Computer, vol. 2, 1986, pp. 342–357.

    Google Scholar 

  4. Aho, A. V., Hopcroft, J. E., & Ullman, J. D., Data Structures and Algorithms, Addison-Wesley, 1983.

    Google Scholar 

  5. Atallah, M. J., “Computing the convex hull of line intersections,” Journal of Algorithms, vol. 7, 1986, pp.285–288.

    Google Scholar 

  6. Avis, A. and Toussaint, G. T., “An optimal algorithm for determining the visibility of a polygon from an edge,” IEEE Transactions on Computers, vol. C-30, No. 12, December 1981, pp.910–914.

    Google Scholar 

  7. Avis, D. and Wenger, R., “Algorithms for line stabbers in space,” Proc. 3rd ACM Symposium on Computational Geometry, 1987, pp.300–307.

    Google Scholar 

  8. Avis, D. and Wenger, R., “Polyhedral line transversals in space,” Discrete and Computational Geometry, vol. 3, No. 3, 1988, pp. 257–266.

    Google Scholar 

  9. Bhattacharya, B. K., Egyed, P., & Toussaint, G. T., “Computing the wingspan of a butterfly,” manuscript in preparation.

    Google Scholar 

  10. Bhattacharya, B. K., Kirkpatrick, D. G., & Toussaint, G. T., “Determining sector visibility of a polygon,” Proc. 5th ACM Symposium on Computational Geometry, Saarbruchen, 1989, pp.247–254.

    Google Scholar 

  11. Bajaj, C. and Li, M., “On the duality of intersection and closest points,” Proc. 21st Allerton Conference, 1983, pp.459–461.

    Google Scholar 

  12. Buchman, E. and Valentine, F. A., “External visibility,” Pacific Journal of Mathematics, vol. 64, 1976, pp. 333–340.

    Google Scholar 

  13. Chazelle, B. M. and Dobkin, D. P., “Detection is easier than computation,” Proc. 12th Annual ACM Symposium on the Theory of Computing, 1980, pp. 146–153.

    Google Scholar 

  14. Chazelle, B. M. and Edelsbrunner, H., “An optimal algorithm for intersecting line segments in the plane,” 29th Annual Symposium on Foundations of Computer Science, October 1988, pp. 590–600.

    Google Scholar 

  15. Chakerian, G. D. and Lange, L. H., “Geometric extremum problems,” Mathematics Magazine, vol. 44, 1971, pp. 57–69.

    Google Scholar 

  16. Ching, Y. T. and Lee, D. T., “Finding the diameter of a set of lines,” Pattern Recognition, vol. 18, 1985, pp. 249–255.

    Google Scholar 

  17. Chang, J. S. and Yap, C. K., “A polynomial solution for potato-peeling and other polygon inclusion and enclosure problems,” Proc. Foundations of Computer Science, West Palm Beach, Fla., 1984, pp. 408–416.

    Google Scholar 

  18. DePano, N. A. A., and Aggarwal, A., “Finding restricted k-envelopes for convex polygons,” Proc. 22nd Allerton Conference, Urbana, Ill., 1984, pp. 81–90.

    Google Scholar 

  19. Dobkin, D. P. and Kirkpatrick, D. G., “Fast detection of polyhedral intersection,” Theoretical Computer Science, vol. 27, 1983, pp. 241–253.

    Google Scholar 

  20. Devroye, L. and Toussaint, G. T., “Convex hulls for random lines,” Tech. Rept. SOCS-90.11, School of Computer Science, McGrill University, May 1990.

    Google Scholar 

  21. Dyer, M. E., “Linear time algorithms for two-and three-variable linear programs,” SIAM Journal of Computing, Vol. 13, No. 1, February 1984, pp. 31–45.

    Google Scholar 

  22. Edelsbrunner, H., “Finding transversals for sets of simple geometric figures,” Theoretical Computer Science, vol. 35, 1985, pp.55–69.

    Google Scholar 

  23. Edelsbrunner, H., “Computing the extreme distances between two convex polygons,” Journal of Algorithms, vol. 6, 1985, pp. 213–224.

    Google Scholar 

  24. Edelsbrunner, H., Overmars, M. H., and Wood, D., “Graphics in flatland: a case study,” Tech. Report F79, Technical University of Graz, 1981.

    Google Scholar 

  25. Edelsbrunner, H., Maurer, H. A., Preparata, F. P., Rosenberg, A. L., Welzl, E., and Wood, D., “Stabbing line segments,” BIT, vol. 22., 1982, pp.274–281.

    Google Scholar 

  26. ElGindy, H. and Toussaint, G. T., “Efficient algorithms for inserting and deleting edges from triangulations,” Proc. Intl. Conf. on Foundations of Data Organization, Kyoto, Japan, May 1985.

    Google Scholar 

  27. Grunbaum, B., “On common transversals,” Arch. Math., vol. 9, 1958, pp. 465–469.

    Google Scholar 

  28. Hershberger, J., “Finding the upper envelope of n line segments in O(n log n) time,” Information Processing Letters, vol. 33, 1989, pp. 169–174.

    Google Scholar 

  29. Houle, M. and Maciel, A., “Finding the widest empty corridor through a set of points,” in Snapshots of Computational and Discrete Geometry, G. T. Toussaint, ed., Tech. Report SOCS-88.11, Computational Geometry Laboratory, McGill University, June 1988, pp. 201–214.

    Google Scholar 

  30. Houle, M., “A measure of separability for point sets,” in Snapshots of Computational and Discrete Geometry, G. T. Toussaint, ed., Tech. Report SOCS-88.11, Computational Geometry Laboratory, McGill University, June 1988, pp. 21–36.

    Google Scholar 

  31. Horn, A. and Valentine, F. A., “Some properties of L-sets in the plane,” Duke Mathematics Journal, vol.16, 1949, pp.131–140.

    Google Scholar 

  32. Kazarinoff, N. D., Geometric Inequalities, Published by the Mathematical Association of America, 1961.

    Google Scholar 

  33. Ke, Y., “Detecting the weak visibility of a simple polygon and related problems,” The Johns Hopkins University, manuscript, March 1988.

    Google Scholar 

  34. Kirkpatrick, D. G. and Seidel, R., “The ultimate planar convex hull algorithm?” SIAM Journal on Computing, vol. 15, No. 1, February 1986, pp. 287–299.

    Google Scholar 

  35. Klee, V. and Laskowski, M. C., “Finding the smallest triangles containing a given convex polygon,” Journal of Algorithms, vol. 6, 1985, pp. 359–375.

    Google Scholar 

  36. Lange, L. H., “Cutting certain minimal corners,” Mathematics Magazine, vol. 32, 1959, pp. 157–160.

    Google Scholar 

  37. Lewis, T., “Two counterexamples concerning transversals for convex subsets of the plane,” Geometriae Dedicata, vol. 9, 1980, pp.461–465.

    Google Scholar 

  38. Megiddo, N., “Linear-time algorithms for linear programming in R3 and related problems,” SIAM Journal on Computing, Vol. 12, 1983, pp. 759–776.

    Google Scholar 

  39. Niven, I., Maxima and Minima Without Calculus, Published by the Mathematical Association of America, 1981.

    Google Scholar 

  40. O'Rourke, J., Aggarwal, A., Maddila, S. and Baldwin, M., “An optimal algorithm for finding minimal enclosing triangles,” Journal of Algorithms, vol. 7, 1986, pp. 258–269.

    Google Scholar 

  41. O'Rourke, J., Art Gallery Theorems and Algorithms, Oxford University Press, 1987.

    Google Scholar 

  42. O'Rourke, J., “An on-line algorithm for fitting straight lines between data ranges,” Communications of the ACM, vol. 24, No. 9, September 1981, pp.574–578.

    Google Scholar 

  43. Overmars, M. and van Leeuwen, H., “Maintenance of configurations in the plane,” Journal of Computer & System Sciences, vol. 23, 1981, pp. 166–204.

    Google Scholar 

  44. Robert, J.-M., “Stabbing hyperspheres by a hyperplane,” in Snapshots of Computational and Discrete Geometry, G. T. Toussaint, ed., Tech. Rep. SOCS-88.11, Computational Geometry Lab., McGill University, June 1988, pp. 181–188.

    Google Scholar 

  45. Rohnert, H., “Shortest paths in the plane with convex polygonal obstacles,” Information Processing Letters, vol. 23, August 1986, pp. 71–86.

    Google Scholar 

  46. Shamos, M. I. and Hoey, D., “Geometric intersection problems,” Seventeenth Annual IEEE Symposium on the Foundations of Computer Science, October 1976, pp. 208–215.

    Google Scholar 

  47. Sharir, M., “The shortest watchtower and related problems for polyhedral terrains,” Information Processing Letters, in press.

    Google Scholar 

  48. Sack, J.-R. and Suri, S., “An optimal algorithm for detecting weak visibility of a polygon,” Tech. Rept. SCS-TR-114, Carleton University, Ottawa, Dec. 1986.

    Google Scholar 

  49. Shermer, T. and Toussaint, G. T., “Characterizations of convex and star-shaped polygons,” in Snapshots of Computational and Discrete Geometry, G. Toussaint, ed., Rept. SOCS-88.11, School of Computer Science, McGill Univ., June 1988.

    Google Scholar 

  50. Teichman, M., “Shoving a table into a corner,” in Snapshots of Computational and Discrete Geometry, G. T. Toussaint, ed., Tech. Report SOCS-88.11, Computational Geometry Laboratory, McGill University, June 1988, pp. 99–118.

    Google Scholar 

  51. Toussaint, G. T., “Solving geometric problems with the rotating calipers,” Proc. MELECON'83, Athens, Greece, 1983.

    Google Scholar 

  52. Valentine, F. A., “Minimal sets of visibility,” Proc. American Mathematical Society, vol. 4, 1953, pp. 917–921.

    Google Scholar 

  53. Valentine, F. A., “Visible shorelines,” American Mathematical Monthly, vol. 77, 1970. pp. 146–152.

    Google Scholar 

  54. Wagner, N. R., “The sofa problem,” American Mathematical Monthly, vol. 83, 1976, pp. 188–189.

    Google Scholar 

  55. Wenger, R., “Stabbing and separation,” Ph.D. thesis, School of Computer Science, McGill University, February 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing Science, Simon Fraser University, Burnaby

    Binay Bhattacharya

  2. School of Computer Science, McGill University, Montreal

    Godfried Toussaint

Authors
  1. Binay Bhattacharya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Godfried Toussaint
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Javier Leach Albert Burkhard Monien Mario Rodríguez Artalejo

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bhattacharya, B., Toussaint, G. (1991). Computing shortest transversals. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds) Automata, Languages and Programming. ICALP 1991. Lecture Notes in Computer Science, vol 510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54233-7_171

Download citation

  • DOI: https://doi.org/10.1007/3-540-54233-7_171

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54233-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation