26 citations · 34 across the 7 of their papers we have counts for
7 papers
On Reporting Durable Patterns in Temporal Proximity Graphs
Pankaj K. Agarwal, Xiao Hu, Stavros Sintos +1
Finding patterns in graphs is a fundamental problem in databases and data mining. In many applications, graphs are temporal and evolve over time, so we are interested in finding du…
Fast and Accurate Approximations of the Optimal Transport in Semi-Discrete and Discrete Settings
Pankaj K. Agarwal, Sharath Raghvendra, Pouyan Shirzadian +1
Given a -dimensional continuous (resp. discrete) probability distribution and a discrete distribution , the semi-discrete (resp. discrete) Optimal Transport (OT) problem…
Vertical Decomposition in 3D and 4D with Applications to Line Nearest-Neighbor Searching in 3D
Pankaj K. Agarwal, Esther Ezra, Micha Sharir
Vertical decomposition is a widely used general technique for decomposing the cells of arrangements of semi-algebraic sets in -space into constant-complexity subcells. In this p…
Convex Hulls under Uncertainty
Pankaj K. Agarwal, Sariel Har-Peled, Subhash Suri +2
We study the convex-hull problem in a probabilistic setting, motivated by the need to handle data uncertainty inherent in many applications, including sensor databases, location-ba…
Maintaining Contour Trees of Dynamic Terrains
Pankaj K. Agarwal, Lars Arge, Thomas Mølhave +2
We consider maintaining the contour tree of a piecewise-linear triangulation that is the graph of a time varying height function $h: \mathbb{R}^2 \rightar…
Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions
Pankaj K. Agarwal, Haim Kaplan, Natan Rubin +1
Let be a set of points and a convex -gon in . We analyze in detail the topological (or discrete) changes in the structure of the Voronoi diagram and t…