Yeganeh Bahoo

activity

20162026

most citedA Time-Space Trade-off for Computing the k-Visibility Region of a Point in a Polygon

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

collaborators

13 papers

cs.RO2026

Pow3R-SLAM: Real-Time RGB-D SLAM with 3D Reconstruction Priors

Christopher Kolios, Ishaan Mehta, Sasa Janjic +2

We present Pow3R-SLAM, a real-time RGB-D simultaneous localization and mapping (SLAM) system that uses Pow3R for tracking and mapping. Inspired by MASt3R-SLAM, a recent work on mon…

cs.CG2026

Efficient K-Visibility Query in Polygons

Yeganeh Bahoo, Roni Sherman

This paper investigates $k$ -visibility, where a line of sight can penetrate up to $k$ obstacles. While computing the $k$ -visibility polygon from a single query point is well-studie…

cs.CG2026

An Exact Generalized k-Cell Decomposition

Yeganeh Bahoo, Sajad Saeedi, Roni Sherman

This paper introduces an exact $k$ -cell decomposition for visibility planning in polygonal environments for agents equipped with $k$ -modems, devices that can see through up to $k$ …

cs.CG2026

Guaranteed Escape for a Bouncing Robot in Pipe Chains

Ahmad Kamaludeen, Somnath Kundu, Yeganeh Bahoo

We study the symmetric bouncing of a point robot within orthogonally-joined rectangles with equal width, which we refer to as pipes. We provide an exhaustive case analysis of every…

cs.CG2025

Generalized k-Cell Decomposition for Visibility Planning in Polygons

Yeganeh Bahoo, Sajad Saeedi, Roni Sherman

This paper introduces a novel $k$ -cell decomposition method for pursuit-evasion problems in polygonal environments, where a searcher is equipped with a $k$ -modem: a device capable…

cs.CG2025

M-Guarding in K-Visibility

Yeganeh Bahoo, Ahmad Kamaludeen

We explore the problem of $M$ -guarding polygons with holes using $k$ -visibility guards, where a set of guards is said to $M$ -guard a polygon if every point in the polygon is visibl…

cs.RO2024

Inverse k-visibility for RSSI-based Indoor Geometric Mapping

Junseo Kim, Matthew Lisondra, Yeganeh Bahoo +1

In recent years, the increased availability of WiFi in indoor environments has gained interest in the robotics community to utilize WiFi signals for indoor simultaneous localizatio…

cs.RO2024

DPPE: Dense Pose Estimation in a Plenoxels Environment using Gradient Approximation

Christopher Kolios, Yeganeh Bahoo, Sajad Saeedi

We present DPPE, a dense pose estimation algorithm that functions over a Plenoxels environment. Recent advances in neural radiance field techniques have shown that it is a powerful…

cs.RO2024

Structure from WiFi (SfW): RSSI-based Geometric Mapping of Indoor Environments

Junseo Kim, Jill Aghyourli Zalat, Yeganeh Bahoo +1

With the rising prominence of WiFi in common spaces, efforts have been made in the robotics community to take advantage of this fact by incorporating WiFi signal measurements in in…

cs.CG2020★ 1 cited

Compatible Paths on Labelled Point Sets

Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz +8

Let $P$ and $Q$ be finite point sets of the same cardinality in $R^{2}$ , each labelled from $1$ to $n$ . Two noncrossing geometric graphs $G_{P}$ and $G_{Q}$ spanning $P$ and $Q$ …

cs.CG2018

Polygon Simplification by Minimizing Convex Corners

Yeganeh Bahoo, Stephane Durocher, J. Mark Keil +3

Let $P$ be a polygon with $r > 0$ reflex vertices and possibly with holes and islands. A subsuming polygon of $P$ is a polygon $P^{'}$ such that $P \subseteq P^{'}$ , each connected compone…

cs.CG2017

Exploring Increasing-Chord Paths and Trees

Yeganeh Bahoo, Stephane Durocher, Sahar Mehrpour +1

A straight-line drawing $Γ$ of a graph $G = (V, E)$ is a drawing of $G$ in the Euclidean plane, where every vertex in $G$ is mapped to a distinct point, and every edge in $G$ is mappe…

cs.CG2016★ 11 cited

A Time-Space Trade-off for Computing the k-Visibility Region of a Point in a Polygon

Yeganeh Bahoo, Bahareh Banyassady, Prosenjit Bose +2

Let $P$ be a simple polygon with $n$ vertices, and let $q \in P$ be a point in $P$ . Let $k \in {0, \dots, n - 1}$ . A point $p \in P$ is $k$ -visible from $q$ if and only if the li…