Pankaj K. Agarwal

Pankaj K. Agarwal
  • RJR Nabisco 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, PK, and Matoušek, J. "Relative neighborhood graphs in three dimensions." Computational Geometry: Theory and Applications 2.1 (1992): 1-14.

Agarwal, PK, and Sharir, M. "Off-line dynamic maintenance of the width of a planar point set." Computational Geometry: Theory and Applications 1.2 (1991): 65-78.

Agarwal, PK, Aggarwal, A, Aronov, B, Kosaraju, SR, Schieber, B, and Suri, S. "Computing external farthest neighbors for a simple polygon." Discrete Applied Mathematics 31.2 (1991): 97-111.

Agarwal, PK, Edelsbrunner, H, Schwarzkopf, O, and Welzl, E. "Euclidean minimum spanning trees and bichromatic closest pairs." Discrete & Computational Geometry 6.1 (1991): 407-422. Full Text

Agarwal, PK. "Partitioning arrangements of lines II: Applications." Discrete & Computational Geometry 5.1 (1990): 533-573. Full Text

Agarwal, PK, Aronov, B, Sharir, M, and Suri, S. "Selecting distances in the plane." (1990): 321-331.

Agarwal, PK, and Sharir, M. "Red-blue intersection detection algorithms, with applications to motion planning and collision detection." SIAM Journal on Computing 19.2 (1990): 297-321.

Agarwal, PK, Edelsbrunner, H, Schwarzkopf, O, and Welzl, E. "Euclidean minimum spanning trees and bichromatic closest pairs." (1990): 203-210.

Agarwal, PK. "Partitioning arrangements of lines I: An efficient deterministic algorithm." Discrete & Computational Geometry 5.1 (1990): 449-483. Full Text

Agarwal, PK, Sharir, M, and Shor, P. "Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences." Journal of Combinatorial Theory, Series A 52.2 (1989): 228-274.

Pages