Mohammad Ali Abam

activity

20132025

most citedNew Constructions of SSPDs and their Applications

16 citations · 17 across the 6 of their papers we have counts for

collaborators

8 papers

cs.CG2025★ 16 cited

New Constructions of SSPDs and their Applications

Mohammad A. Abam, Sariel Har-Peled

We present a new optimal construction of a semi-separated pair decomposition (i.e., SSPD) for a set of $n$ points in $ℜ^{d}$ . In the new constructio…

cs.GT2025

Tight Bounds On the Distortion of Randomized and Deterministic Distributed Voting

Mohammad Ali Abam, Davoud Kareshki, Marzieh Nilipour +2

We study metric distortion in distributed voting, where $n$ voters are partitioned into $k$ groups, each selecting a local representative, and a final winner is chosen from these r…

cs.CG2022

Maximum Weight Convex Polytope

Mohammad Ali Abam, Ali Mohammad Lavasani, Denis Pankratov

We study the maximum weight convex polytope problem, in which the goal is to find a convex polytope maximizing the total weight of enclosed points. Prior to this work, the only kno…

cs.CG2020

Geodesic Spanners for Points in $R^{3}$ amid Axis-parallel Boxes

Mohammad Ali Abam, Mohammad Javad Rezaei Seraji

Let $P$ be a set of $n$ points in $R^{3}$ amid a bounded number of obstacles. When obstacles are axis-parallel boxes, we prove that $P$ admits an $83$ -spanner with $O…

cs.CG2015

Geodesic Spanners for Points on a Polyhedral Terrain

Mohammad Ali Abam, Mark de Berg, Mohammad Javad Rezaei Seraji

We show that there exists a geodesic spanner with almost linear number of edges.

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.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