24 citations · 24 across the 5 of their papers we have counts for
5 papers
Scalable Optimal Transport Algorithm for Network Alignment
Elaheh Hassani, Durga Mandarapu, Qi Yu +2
Network alignment identifies node correspondences across different networks and is a fundamental primitive in many data science applications, including social network analysis, fra…
Rethinking Collision Detection on GPU Ray Tracing Architecture
Durga Keerthi Mandarapu, Isaac Fuksman, Artem Pelenitsyn +2
Discrete Collision Detection (DCD) is a fundamental task in several domains including particle-based physics simulations. Efficient DCD uses indexing structures such as Bounding Vo…
Mochi: Fast \& Exact Collision Detection
Durga Keerthi Mandarapu, Nicholas James, Milind Kulkarni
Collision Detection (CD) has several applications across the domains such as robotics, visual graphics, and fluid mechanics. Finding exact collisions between the objects in the sce…
Arkade: k-Nearest Neighbor Search With Non-Euclidean Distances using GPU Ray Tracing
Durga Mandarapu, Vani Nagarajan, Artem Pelenitsyn +1
High-performance implementations of -Nearest Neighbor Search (NN) in low dimensions use tree-based data structures. Tree algorithms are hard to parallelize on GPUs due to the…
RT-kNNS Unbound: Using RT Cores to Accelerate Unrestricted Neighbor Search
Vani Nagarajan, Durga Mandarapu, Milind Kulkarni
The problem of identifying the k-Nearest Neighbors (kNNS) of a point has proven to be very useful both as a standalone application and as a subroutine in larger applications. Given…