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

Agarwal, P. K., and C. M. Procopiuc. “Approximation algorithms for projective clustering.” Journal of Algorithms, vol. 46, no. 2, Jan. 2003, pp. 115–39. Scopus, doi:10.1016/S0196-6774(02)00295-X. Full Text

Agarwal, P. K., et al. “A (1+ε) -approximation algorithm for 2 -line-center.” Computational Geometry: Theory and Applications, vol. 26, no. 2, 2003, pp. 119–28.

Agarwal, P. K., et al. “Algorithmic issues in modeling motion.” Acm Computing Surveys, vol. 34, no. 4, Dec. 2002, pp. 550–72. Scopus, doi:10.1145/592642.592647. Full Text

Procopiuc, C. M., et al. “A Monte Carlo algorithm for fast projective clustering.” Proceedings of the Acm Sigmod International Conference on Management of Data, Sept. 2002, pp. 418–27.

Agarwal, P. K., et al. “Curvature-constrained shortest paths in a convex polygon.” Siam Journal on Computing, vol. 31, no. 6, Sept. 2002, pp. 1814–51. Scopus, doi:10.1137/S0097539700374550. Full Text

Agarwal, P. K., et al. “Deformable free-space tilings for kinetic collision detection.” International Journal of Robotics Research, vol. 21, no. 3, Mar. 2002, pp. 179–97. Scopus, doi:10.1177/027836402320556395. Full Text

Agarwal, P., et al. “Lenses in arrangements of pseudo-circles and their applications.” Proceedings of the Annual Symposium on Computational Geometry, Jan. 2002, pp. 123–32.

Agarwal, P. K., et al. “Box-trees and R-trees with near-optimal query time.” Discrete and Computational Geometry, vol. 28, no. 3, Jan. 2002, pp. 291–312. Scopus, doi:10.1007/s00454-002-2817-1. Full Text

Agarwal, P. K., et al. “Polygon decomposition for efficient construction of Minkowski sums.” Computational Geometry: Theory and Applications, vol. 21, no. 1–2, Jan. 2002, pp. 39–61. Scopus, doi:10.1016/S0925-7721(01)00041-4. Full Text

Agarwal, P. K., and M. Sharir. “The number of congruent simplices in a point set.” Discrete and Computational Geometry, vol. 28, no. 2, Jan. 2002, pp. 123–50. Scopus, doi:10.1007/s00454-002-0727-x. Full Text