Skip to main content

Pankaj K. Agarwal

RJR Nabisco Distinguished Professor of Computer Science in Trinity College of Arts and Sciences
Computer Science
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


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

A Subquadratic Algorithm for Computing the L1-Distance Between Two Terrains

Conference Leibniz International Proceedings in Informatics Lipics · June 20, 2025 We study the problem of computing the L1-distance between two piecewise-linear bivariate functions f and g, defined over a bounded polygonal domain M ⊂ R2, that is, computing the quantity ∥f-g∥1 = ∫M|f(x, y)-g(x, y)| dx dy. If f and g are defined by linear ... Full text Cite

Computing Instance-Optimal Kernels in Two Dimensions

Journal Article Discrete and Computational Geometry · April 1, 2025 Let P be a set of n points in R2. For a parameter ε∈(0,1), a subset C⊆P is an ε-kernel of P if the projection of the convex hull of C approximates that of P within (1-ε)-factor in every direction. The set C is a weakε-kernel of P if its directio ... Full text Cite
View All Publications

External Links


Agarwal Website