Pankaj K. Agarwal

Pankaj K. Agarwal
  • RJR Nabisco Distinguished Professor of Computer Science in Trinity College of Arts and Sciences
  • Professor of Computer Science
  • Chair 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 at Santa Cruz 1986

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

Agarwal, P. K., and H. Wanq. “Approximation algorithms for curvature-constrained shortest paths.” Siam Journal on Computing, vol. 30, no. 6, Dec. 2000, pp. 1739–72.

Agarwal, P. K., et al. “Binary space partitions for fat rectangles.” Siam Journal on Computing, vol. 29, no. 5, Mar. 2000, pp. 1422–48. Scopus, doi:10.1137/S0097539797320578. Full Text

Agarwal, P. K., and M. Sharir. “Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions.” Discrete and Computational Geometry, vol. 24, no. 4, Jan. 2000, pp. 645–85. Scopus, doi:10.1007/s4540010064. Full Text

Agarwal, P. K., et al. “Cylindrical static and kinetic binary space partitions.” Computational Geometry: Theory and Applications, vol. 16, no. 2, Jan. 2000, pp. 103–27. Scopus, doi:10.1016/S0925-7721(00)00005-5. Full Text

Agarwal, P. K., and K. R. Varadarajan. “Efficient algorithms for approximating polygonal chains.” Discrete and Computational Geometry, vol. 23, no. 2, Jan. 2000, pp. 273–91. Scopus, doi:10.1007/PL00009500. Full Text

Varadarajan, K. R., and P. K. Agarwal. “Approximating shortest paths on a nonconvex polyhedron.” Siam Journal on Computing, vol. 30, no. 4, Jan. 2000, pp. 1321–40. Scopus, doi:10.1137/S0097539799352759. Full Text

Agarwal, P. K., et al. “Exact and approximation algorithms for minimum-width cylindrical shells.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, Jan. 2000, pp. 510–17.

Agarwal, P. K., and P. K. Desikan. “Approximation algorithms for layered manufacturing.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, Jan. 2000, pp. 528–37.

Agarwal, P. K., and C. M. Procopiuc. “Approximation algorithms for projective clustering.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, Jan. 2000, pp. 538–47.

Agarwal, P. K., et al. “Computing approximate shortest paths on convex polytopes.” Proceedings of the Annual Symposium on Computational Geometry, Jan. 2000, pp. 270–79.

Pages