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 J. Matoušek. “Relative neighborhood graphs in three dimensions.” Computational Geometry: Theory and Applications, vol. 2, no. 1, Jan. 1992, pp. 1–14. Scopus, doi:10.1016/0925-7721(92)90017-M. Full Text

Agarwal, P. K., et al. “Farthest neighbors, maximum spanning trees and related problems in higher dimensions.” Computational Geometry: Theory and Applications, vol. 1, no. 4, Jan. 1992, pp. 189–201. Scopus, doi:10.1016/0925-7721(92)90001-9. Full Text

Agarwal, P. K., et al. “Euclidean minimum spanning trees and bichromatic closest pairs.” Discrete &Amp; Computational Geometry, vol. 6, no. 1, Dec. 1991, pp. 407–22. Scopus, doi:10.1007/BF02574698. Full Text

Agarwal, P. K., et al. “Computing external farthest neighbors for a simple polygon.” Discrete Applied Mathematics, vol. 31, no. 2, Apr. 1991, pp. 97–111. Scopus, doi:10.1016/0166-218X(91)90063-3. Full Text

Agarwal, P. K., and M. Sharir. “Applications of a new space-partitioning technique.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 519 LNCS, Jan. 1991, pp. 379–91. Scopus, doi:10.1007/BF02189304. Full Text

Agarwal, P. K., and M. Sharir. “Off-line dynamic maintenance of the width of a planar point set.” Computational Geometry: Theory and Applications, vol. 1, no. 2, Jan. 1991, pp. 65–78. Scopus, doi:10.1016/0925-7721(91)90001-U. Full Text

Agarwal, P. K. “Partitioning arrangements of lines II: Applications.” Discrete &Amp; Computational Geometry, vol. 5, no. 1, Dec. 1990, pp. 533–73. Scopus, doi:10.1007/BF02187809. Full Text

Agarwal, P. K. “Partitioning arrangements of lines I: An efficient deterministic algorithm.” Discrete &Amp; Computational Geometry, vol. 5, no. 1, Dec. 1990, pp. 449–83. Scopus, doi:10.1007/BF02187805. Full Text

Agarwal, P. K., et al. Selecting distances in the plane. Jan. 1990, pp. 321–31. Scopus, doi:10.1145/98524.98597. Full Text

Agarwal, P. K., and M. Sharir. “Red-blue intersection detection algorithms, with applications to motion planning and collision detection.” Siam Journal on Computing, vol. 19, no. 2, Jan. 1990, pp. 297–321. Scopus, doi:10.1137/0219020. Full Text

Pages