2 citations · 2 across the 4 of their papers we have counts for
4 papers
Edge complexity of geometric graphs on convex independent point sets
Abhijeet Khopkar
In this paper, we focus on a generalised version of Gabriel graphs known as Locally Gabriel graphs () and Unit distance graphs () on convexly independent point sets. $U…
Geometric graphs on convex point sets
Abhijeet Khopkar, Sathish Govindrajan
In this note, we introduce a family of bipartite graphs called path restricted ordered bipartite graphs and present it as an abstract generalization of some well known geometric gr…
On Locally Gabriel Geometric Graphs
Sathish Govindarajan, Abhijeet Khopkar
Let be a set of points in the plane. A geometric graph on is said to be {\it locally Gabriel} if for every edge in , the disk with and as diamete…
On Computing Optimal Locally Gabriel Graphs
Abhijeet Khopkar, Sathish Govindarajan
Delaunay and Gabriel graphs are widely studied geometric proximity structures. Motivated by applications in wireless routing, relaxed versions of these graphs known as \emph{Locall…