Journal of the ACM Bibliography

Selected papers that cite this one

• Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, and Catherine A. Schevon. Star unfolding of a polytope with applications. SIAM Journal on Computing, 26(6):1689-1713, December 1997.

• Pankaj K. Agarwal and Micha Sharir. Ray shooting amidst convex polygons in 2D. Journal of Algorithms, 21(3):508-519, November 1996.

• Pankaj K. Agarwal and Micha Sharir. Ray shooting amidst convex polyhedra and polyhedral terrains in three dimensions. SIAM Journal on Computing, 25(1):100-116, February 1996.

• Nancy M. Amato, Michael T. Goodrich, and Edgar A. Ramos. Computing faces in segment and simplex arrangements (preliminary version). In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 672-683, Las Vegas, Nevada, 29 May-1 June 1995.

• Bernard Chazelle. Computational geometry: A restrospective. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 75-94, Montréal, Québec, Canada, 23-25 May 1994.

• Olivier Devillers. An introduction to randomization in computational geometry. Theoretical Computer Science, 157(1):35-52, 9 April 1996.

• Ji\v{r}í Matou\v{s}ek, János Pach, Micha Sharir, Shmuel Sifrony, and Emo Welzl. Fat triangles determine linearly many holes. SIAM Journal on Computing, 23(1):154-169, February 1994.

• K. Mulmuley. Randomized geometric algorithms and pseudorandom generators. Algorithmica, 16(4/5):450-463, October/November 1996.

• Marco Pellegrini. On point location and motion planning among simplices (extended abstract). In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 95-104, Montréal, Québec, Canada, 23-25 May 1994.

• Marco Pellegrini. On point location and motion planning among simplices. SIAM Journal on Computing, 25(5):1061-1081, October 1996.

• Biing-Feng Wang. Tighter bounds on the solution of a divide-and-conquer maximin recurrence. Journal of Algorithms, 23(2):329-344, May 1997.

Selected references

• Michael Ben-Or. Lower bounds for algebraic computation trees (preliminary report). In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pages 80-86, Boston, Massachusetts, 25-27 April 1983.

• Herbert Edelsbrunner and Leonidas J. Guibas. Topologically sweeping an arrangement. In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pages 389-403, Berkeley, California, 28-30 May 1986.

• Leo J. Guibas and Robert Sedgewick. A dichromatic framework for balanced trees. In 19th Annual Symposium on Foundations of Computer Science, pages 8-21, Ann Arbor, Michigan, 16-18 October 1978. IEEE.

• Kurt Hoffman, Kurt Mehlhorn, Pierre Rosenstiehl, and Robert E. Tarjan. Sorting Jordan sequences in linear time using level-linked search trees. Information and Control, 68(1-3):170-184, January/February/March 1986.

• Ketan Mulmuley. A fast planar partition algorithm, I (extended abstract). In 29th Annual Symposium on Foundations of Computer Science, pages 580-589, White Plains, New York, 24-26 October 1988. IEEE.

Shortcuts: