Scholars@Duke
Pankaj K. Agarwal

Pankaj K. Agarwal

RJR Nabisco Distinguished Professor of Computer Science in Trinity College of Arts and Sciences
Computer Science
pankaj@cs.duke.edu
Box 90129, Durham, NC 27708-0129
D214A Lev Sci Res Ctr, Durham, NC 27708

Overview

Geometric algorithms, discrete geometry, geometric data analysis, data structures, database systems and data mining, robotics algorithms, geographic information systems.

Current Appointments & Affiliations

RJR Nabisco Distinguished Professor of Computer Science in Trinity College of Arts and Sciences · 2008 - Present Computer Science, Trinity College of Arts & Sciences
Professor of Computer Science · 1998 - Present Computer Science, Trinity College of Arts & Sciences
Professor of Mathematics · 2009 - Present Mathematics, Trinity College of Arts & Sciences
Bass Fellow · 2005 - Present Computer Science, Trinity College of Arts & Sciences

In the News

Published November 12, 2023
Five Decades of Creating History and Pushing Boundaries at Duke Computer Science

View All News

Recent Publications

Semi-Algebraic Off-line Range Searching and Biclique Partitions in the Plane

Journal Article Discrete and Computational Geometry · March 1, 2026 Let P be a set of m points in R2, let Σ be a set of n semi-algebraic sets of constant complexity in R2, let (S,+) be a semigroup, and let w:P→S be a weight function on the points of P. We describe a randomized algorithm for computing w(P∩σ)=∑p∈P∩σw(p) for ... Full text Cite

Computing the Heaviest Disk and Related Problems

Conference Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms · January 1, 2026 We present an algorithm that, given m points and n disks in R2, computes the disk that contains the maximum number of points. The algorithm runs in O∗(m2/3n2/3 + m32/59 ... Full text Cite

Optimal Motion Planning for Two Square Robots in a Rectilinear Environment

Conference Leibniz International Proceedings in Informatics Lipics · June 20, 2025 Let W ⊂ R2 be a rectilinear polygonal environment (that is, a rectilinear polygon potentially with holes) with a total of n vertices, and let A,B be two robots, each modeled as an axis-aligned unit square, that can move rectilinearly inside W. The goal is ... Full text Cite
View All Publications

External Links

Agarwal Website