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 M. Sharir. “Planar geometric location problems.” Algorithmica, vol. 11, no. 2, Feb. 1994, pp. 185–95. Scopus, doi:10.1007/BF01182774. Full Text

Agarwal, P. K., and S. Suri. “Surface approximation and geometric partitions.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, Jan. 1994, pp. 24–33.

Agarwal, P. K., et al. “Applications of parametric searching in geometric optimization.” Journal of Algorithms, vol. 17, no. 3, Jan. 1994, pp. 292–318. Scopus, doi:10.1006/jagm.1994.1038. Full Text

Agarwal, P. K. “On stabbling lines for convex polyhedra in 3D.” Computational Geometry: Theory and Applications, vol. 4, no. 4, Jan. 1994, pp. 177–89. Scopus, doi:10.1016/0925-7721(94)90016-7. Full Text

Agarwal, P. K., et al. “Computing many faces in arrangements of lines and segments.” Proceedings of the Annual Symposium on Computational Geometry, Jan. 1994, pp. 76–84.

Agarwal, P. K., et al. “Computing envelopes in four dimensions with applications.” Proceedings of the Annual Symposium on Computational Geometry, Jan. 1994, pp. 348–58.

Agarwal, P. K., et al. “Constructing levels in arrangements and higher order Voronoi diagrams.” Proceedings of the Annual Symposium on Computational Geometry, Jan. 1994, pp. 67–75.

Agarwal, P. K., et al. “Can visibility graphs be represented compactly?Proceedings of the 9th Annual Symposium on Computational Geometry, Dec. 1993, pp. 338–47.

Agarwal, P. K., et al. “Selecting distances in the plane.” Algorithmica, vol. 9, no. 5, May 1993, pp. 495–514. Scopus, doi:10.1007/BF01187037. Full Text

Agarwal, P. K., et al. “Computing a segment center for a planar point set.” Journal of Algorithms, vol. 15, no. 2, Jan. 1993, pp. 314–23. Scopus, doi:10.1006/jagm.1993.1043. Full Text

Pages