Pankaj K. Agarwal

Pankaj K. Agarwal
  • RJR Nabisco Distinguished Professor of Computer Science in Trinity College of Arts and Sciences
  • Professor of Computer Science
  • Professor of Mathematics (Secondary)
  • Faculty Network Member of The Energy Initiative
  • Bass Fellow
External address: D315 Lev Sci Res Ctr, Durham, NC 27708
Internal office address: Box 90129, Durham, NC 27708-0129
Phone: (919) 660-6548

Computational and combinatorial geometry, computational biology, robotics, spatial databases, geographic molecular information systems, and data structures.

Education & Training
  • Ph.D., New York University 1989

  • M.S., University of California - Santa Cruz 1986

  • B.S.E.E., Indian Institute of Technology (India) 1982

Varadarajan, K. R., and P. K. Agarwal. “Approximation algorithms for bipartite and non-bipartite matching in the plane.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, Jan. 1999, pp. 805–14.

Agarwal, P. K., et al. “Lower bounds for kinetic planar subdivisions.” Proceedings of the Annual Symposium on Computational Geometry, Jan. 1999, pp. 247–54. Scopus, doi:10.1145/304893.304961. Full Text

Agarwal, P. K., and M. Sharir. “Pipes, cigars, and kreplach: The union of Minkowski sums in three dimensions.” Proceedings of the Annual Symposium on Computational Geometry, Jan. 1999, pp. 143–53.

Agarwal, P. K., et al. “Approximation and exact algorithms for minimum-width annuli and shells.” Proceedings of the Annual Symposium on Computational Geometry, Jan. 1999, pp. 380–89. Scopus, doi:10.1145/304893.304992. Full Text

Agarwal, P. K., et al. “Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications.” Siam Journal on Computing, vol. 29, no. 3, Jan. 1999, pp. 912–53. Scopus, doi:10.1137/s0097539795295936. Full Text

Agarwal, P. K., et al. “Motion planning for a convex polygon in a polygonal environment.” Discrete and Computational Geometry, vol. 22, no. 2, Jan. 1999, pp. 201–21. Scopus, doi:10.1007/PL00009455. Full Text

Agarwal, P. K., et al. “Parametric and kinetic minimum spanning trees.” Annual Symposium on Foundations of Computer Science  Proceedings, Dec. 1998, pp. 596–605.

Agarwal, P. K., and M. Sharir. “Efficient Algorithms for Geometric Optimization.” Acm Computing Surveys, vol. 30, no. 4, Dec. 1998, pp. 412–58. Scopus, doi:10.1145/299917.299918. Full Text

Agarwal, P. K., et al. “Kinetic binary space partitions for intersecting segments and disjoint triangles.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, Dec. 1998, pp. 107–16.

Agarwal, P. K., et al. “I/O-efficient algorithms for contour-line extraction and planar graph blocking.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, Dec. 1998, pp. 117–26.

Pages