Zahed Rahmati

activity

20132026

most citedDrug-Target Interaction/Affinity Prediction: Deep Learning Models and Advances Review

37 citations · 40 across the 12 of their papers we have counts for

collaborators

Showing cs.CGShow all

6 papers · 1 filter

cs.CG2020

RAC Drawings in Subcubic Area

Zahed Rahmati, Fatemeh Emami

In this paper, we study tradeoffs between curve complexity and area of Right Angle Crossing drawings (RAC drawings), which is a challenging theoretical problem in graph drawing. Gi…

cs.CG2019

Emanation Graph: A Plane Geometric Spanner with Steiner Points

Bardia Hamedmohseni, Zahed Rahmati, Debajyoti Mondal

An emanation graph of grade $k$ on a set of points is a plane spanner made by shooting $2^{k + 1}$ equally spaced rays from each point, where the shorter rays stop the longer ones up…

cs.CG2014

Kinetic $k$ -Semi-Yao Graph and its Applications

Zahed Rahmati, Mohammad Ali Abam, Valerie King +1

This paper introduces a new proximity graph, called the $k$ -Semi-Yao graph ( $k$ -SYG), on a set $P$ of points in $R^{d}$ , which is a supergraph of the $k$ -nearest neighbor gr…

cs.CG2014

Kinetic Reverse $k$ -Nearest Neighbor Problem

Zahed Rahmati, Valerie King, Sue Whitesides

This paper provides the first solution to the kinetic reverse $k$ -nearest neighbor (\rknn) problem in $R^{d}$ , which is defined as follows: Given a set $P$ of $n$ moving poi…

cs.CG2013

A Simple, Faster Method for Kinetic Proximity Problems

Zahed Rahmati, Mohammad Ali Abam, Valerie King +2

For a set of $n$ points in the plane, this paper presents simple kinetic data structures (KDS's) for solutions to some fundamental proximity problems, namely, the all nearest neigh…

cs.CG2013★ 1 cited

Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in R^d