Pankaj K. Agarwal
YOU?
Author Swipe
View article: Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems Open
Let \(\mathcal{T}\) be a set of \(n\) flat (planar) semi-algebraic regions in \(\mathbb{R}^{3}\) of constant complexity (e.g., triangles, disks), which we call plates . We wish to preprocess \(\mathcal{T}\) into a data structure so that fo…
View article: On Two-Handed Planar Assembly Partitioning with Connectivity Constraints
On Two-Handed Planar Assembly Partitioning with Connectivity Constraints Open
Assembly planning is a fundamental problem in robotics and automation, which involves designing a sequence of motions to bring the separate constituent parts of a product into their final placement in the product. Assembly planning is natu…
View article: A Subquadratic Algorithm for Computing the L₁-Distance Between Two Terrains
A Subquadratic Algorithm for Computing the L₁-Distance Between Two Terrains Open
We study the problem of computing the L₁-distance between two piecewise-linear bivariate functions f and g, defined over a bounded polygonal domain 𝕄 ⊂ ℝ², that is, computing the quantity ‖f-g‖₁ = ∫_𝕄 |f(x,y)-g(x,y)| dx dy. If f and g are …
View article: Line Intersection Searching Amid Unit Balls in 3-Space
Line Intersection Searching Amid Unit Balls in 3-Space Open
View article: On Reporting Durable Patterns in Temporal Proximity Graphs
On Reporting Durable Patterns in Temporal Proximity Graphs Open
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 durable patterns, such as triangles and paths, which persist …
View article: Semi-Algebraic Off-line Range Searching and Biclique Partitions in the Plane
Semi-Algebraic Off-line Range Searching and Biclique Partitions in the Plane Open
Let $P$ be a set of $m$ points in ${\mathbb R}^2$, let $Σ$ be a set of $n$ semi-algebraic sets of constant complexity in ${\mathbb R}^2$, let $(S,+)$ be a semigroup, and let $w: P \rightarrow S$ be a weight function on the points of $P$. W…
View article: Computing Data Distribution from Query Selectivities
Computing Data Distribution from Query Selectivities Open
We are given a set 𝒵 = {(R_1,s_1), …, (R_n,s_n)}, where each R_i is a range in ℝ^d, such as rectangle or ball, and s_i ∈ [0,1] denotes its selectivity. The goal is to compute a small-size discrete data distribution 𝒟 = {(q₁,w₁),…, (q_m,w_m…
View article: Program Committee
Program Committee Open
View article: Fast and Accurate Approximations of the Optimal Transport in Semi-Discrete and Discrete Settings
Fast and Accurate Approximations of the Optimal Transport in Semi-Discrete and Discrete Settings Open
Given a $d$-dimensional continuous (resp. discrete) probability distribution $μ$ and a discrete distribution $ν$, the semi-discrete (resp. discrete) Optimal Transport (OT) problem asks for computing a minimum-cost plan to transport mass fr…
View article: Fast Approximation Algorithms for Piercing Boxes by Points
Fast Approximation Algorithms for Piercing Boxes by Points Open
$\newcommand{\popt}{\mathcal{p}} \newcommand{\Re}{\mathbb{R}}\newcommand{\N}{\mathcal{N}} \newcommand{\BX}{\mathcal{B}} \newcommand{\bb}{\mathsf{b}} \newcommand{\eps}{\varepsilon} \newcommand{\polylog}{\mathrm{polylog}} $ Let $\mathcal{B}=…
View article: Vertical Decomposition in 3D and 4D with Applications to Line Nearest-Neighbor Searching in 3D
Vertical Decomposition in 3D and 4D with Applications to Line Nearest-Neighbor Searching in 3D Open
Vertical decomposition is a widely used general technique for decomposing the cells of arrangements of semi-algebraic sets in $d$-space into constant-complexity subcells. In this paper, we settle in the affirmative a few long-standing open…
View article: On reverse shortest paths in geometric proximity graphs
On reverse shortest paths in geometric proximity graphs Open
View article: Computing Instance-Optimal Kernels in Two Dimensions
Computing Instance-Optimal Kernels in Two Dimensions Open
Let P be a set of n points in ℝ². 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 i…
View article: Computing Complex Temporal Join Queries Efficiently
Computing Complex Temporal Join Queries Efficiently Open
This paper studies multi-way join queries over temporal data, where each tuple is associated with a valid time interval indicating when the tuple is valid. A temporal join requires that joining tuples' valid intervals intersect. Previous w…
View article: Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems Open
Let 𝒯 be a set of n planar semi-algebraic regions in ℝ³ of constant complexity (e.g., triangles, disks), which we call plates. We wish to preprocess 𝒯 into a data structure so that for a query object γ, which is also a plate, we can quickl…
View article: Efficiently Answering Durability Prediction Queries
Efficiently Answering Durability Prediction Queries Open
We consider a class of queries called durability prediction queries that arise commonly in predictive analytics, where we use a given predictive model to answer questions about possible futures to inform our decisions. Examples of durabili…
View article: Dynamic Enumeration of Similarity Joins
Dynamic Enumeration of Similarity Joins Open
This paper considers enumerating answers to similarity-join queries under dynamic updates: Given two sets of $n$ points $A,B$ in $\mathbb{R}^d$, a metric $ϕ(\cdot)$, and a distance threshold $r > 0$, report all pairs of points $(a, b) \in …
View article: Efficiently Answering Durability Prediction Queries
Efficiently Answering Durability Prediction Queries Open
We consider a class of queries called durability prediction queries that arise commonly in predictive analytics, where we use a given predictive model to answer questions about possible futures to inform our decisions. Examples of durabili…
View article: Durable Top-K Instant-Stamped Temporal Records with User-Specified Scoring Functions
Durable Top-K Instant-Stamped Temporal Records with User-Specified Scoring Functions Open
A way of finding interesting or exceptional records from instant-stamped temporal data is to consider their "durability," or, intuitively speaking, how well they compare with other records that arrived earlier or later, and how long they r…
View article: On Two-Handed Planar Assembly Partitioning
On Two-Handed Planar Assembly Partitioning Open
Assembly planning, which is a fundamental problem in robotics and automation, aims to design a sequence of motions that will bring the separate constituent parts of a product into their final placement in the product. It is convenient to s…
View article: An Output-Sensitive Algorithm for Computing the Union of Cubes and Fat Boxes in 3D
An Output-Sensitive Algorithm for Computing the Union of Cubes and Fat Boxes in 3D Open
Let C be a set of n axis-aligned cubes of arbitrary sizes in ℝ³. Let U be their union, and let κ be the number of vertices on ∂U; κ can vary between O(1) and O(n²). We show that U can be computed in O(n log³ n + κ) time if C is in general …
View article: Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications Open
In 2015, Guth proved that if $S$ is a collection of $n$ $g$-dimensional semi-algebraic sets in $\mathbb{R}^d$ and if $D\geq 1$ is an integer, then there is a $d$-variate polynomial $P$ of degree at most $D$ so that each connected component…
View article: Decomposing the Complement of the Union of Cubes in Three Dimensions
Decomposing the Complement of the Union of Cubes in Three Dimensions Open
View article: 1D and 2D Flow Routing on a Terrain
1D and 2D Flow Routing on a Terrain Open
An important problem in terrain analysis is modeling how water flows across a\nterrain creating floods by forming channels and filling depressions. In this\npaper we study a number of \\emph{flow-query} related problems: Given a terrain\n$…
View article: Dynamic geometric set cover and hitting set
Dynamic geometric set cover and hitting set Open
We investigate dynamic versions of geometric set cover and hitting set where points and ranges may be inserted or deleted, and we want to efficiently maintain an (approximately) optimal solution for the current problem instance. While thei…
View article: Clustering Under Perturbation Stability in Near-Linear Time
Clustering Under Perturbation Stability in Near-Linear Time Open
We consider the problem of center-based clustering in low-dimensional Euclidean spaces under the perturbation stability assumption. An instance is α-stable if the underlying optimal clustering continues to remain optimal even when all pair…
View article: Dynamic Geometric Set Cover and Hitting Set
Dynamic Geometric Set Cover and Hitting Set Open
We investigate dynamic versions of geometric set cover and hitting set where points and ranges may be inserted or deleted, and we want to efficiently maintain an (approximately) optimal solution for the current problem instance. While thei…
View article: Management Training and Employment: An Empirical Analysis of Management Institutes
Management Training and Employment: An Empirical Analysis of Management Institutes Open
The study seeks to identify those difficulties and offer novel perspectives on them as well as potential solutions. This research aims to quantify the perception gap between recruiters, academics, and MBA graduates with regards to the impo…
View article: Theory of Reasoned Action and Organic Food Buying in India
Theory of Reasoned Action and Organic Food Buying in India Open
The purpose of this paper is to find out a relationship between attitude towards organic food, subjective norms and buying intention of organic food. This study explores the impact of attitude and subjective norms on buying intentions and …
View article: Flood-Risk Analysis on Terrains under the Multiflow-Direction Model
Flood-Risk Analysis on Terrains under the Multiflow-Direction Model Open
An important problem in terrain analysis is modeling how water flows across a terrain and creates floods by filling up depressions. In this article, we study a number of flood-risk related problems: Given a terrain Σ, represented as a tria…