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


Comprehensive guide for epigenetics and transcriptomics data quality control.

Journal Article STAR Protoc · March 21, 2025 Host response to environmental exposures such as pathogens and chemicals can include modifications to the epigenome and transcriptome. Improved signature discovery, including the identification of the agent and timing of exposure, has been enabled by advan ... Full text Link to item Cite

Line Intersection Searching Amid Unit Balls in 3-Space

Journal Article Algorithmica · February 1, 2025 Let B be a set of n unit balls in R3. We present a linear-size data structure for storing B that can determine in O∗(n) time whether a query line intersects any ball of B and report all k such balls in additional O(k) time. The data structure can be constr ... Full text Cite

Efficient Approximation Algorithm for Computing Wasserstein Barycenter under Euclidean Metric

Conference Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms · January 1, 2025 Given a set of probability distributions, the Wasserstein barycenter problem asks to compute a distribution that minimizes the average Wasserstein distance, or optimal transport cost, from all the input distributions. Wasserstein barycenters preserve commo ... Cite
View All Publications

External Links


Agarwal Website