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 Duke 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

Recent News Items


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

View All News Items

Recent Scholarly Works


Segment Proximity Graphs and Nearest Neighbor Queries amid Disjoint Segments

Journal article Algorithmica · August 1, 2026 In this paper we study several proximity problems related to a set of pairwise-disjoint segments in R2. Let S be a set of n pairwise-disjoint segments in R2, and let r>0 be a parameter. We define the segment r-proximity graph of S to be Gr(S):=(S,E), where ... Full text Cite

Dynamic Nearest-Neighbor Searching Under General Metrics in ℝ3 and Its Applications

Conference Leibniz International Proceedings in Informatics Lipics · May 27, 2026 Let K be a compact, centrally-symmetric, strictly-convex region in ℝ3, which is a semi-algebraic set of constant complexity, i.e. the unit ball of a corresponding metric, denoted as ∥· ∥K. Let K be a set of n homothetic copies of K. This paper c ... Full text Cite

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
View All Scholarly Works

External Links


Agarwal Website