Yeganeh Bahoo

Orcid: 0000-0001-5349-4946

According to our database1, Yeganeh Bahoo authored at least 21 papers between 2015 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Inverse k-visibility for RSSI-based Indoor geometric mapping.
Auton. Robots, June, 2026

2025
Generalized k-Cell Decomposition for Visibility Planning in Polygons.
CoRR, November, 2025

M-Guarding in K-Visibility.
CoRR, October, 2025

2024
DPPE: Dense Pose Estimation in a Plenoxels Environment using Gradient Approximation.
CoRR, 2024

Systematic Escape Using Billiard Moves.
Proceedings of the 13th International Workshop on Robot Motion and Control, 2024

Structure from WiFi (SfW): RSSI-Based Geometric Mapping of Indoor Environments.
Proceedings of the American Control Conference, 2024

2023
Arithmetic Billiard Paths Revisited: Escaping from a Rectangular Room.
Proceedings of the 27th International Conference on Methods and Models in Automation and Robotics, 2023

Conflict-Free Chromatic Guarding of Orthogonal Polygons with Sliding Cameras.
Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

Segment Visibility for k-Transmitters.
Proceedings of the Algorithmics of Wireless Networks - 19th International Symposium, 2023

2022
Bouncing Robots in Rectilinear Polygons.
Proceedings of the 26th International Conference on Methods and Models in Automation and Robotics, 2022

2020
Computing the k-Visibility Region of a Point in a Polygon.
Theory Comput. Syst., 2020

2019
Computational geometry algorithms for visibility problems.
PhD thesis, 2019

A time-space trade-off for computing the <i>k</i>-visibility region of a point in a polygon.
Theor. Comput. Sci., 2019

Computing the k-Crossing Visibility Region of a Point in a Polygon.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Watchtower for k-crossing Visibility.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018
Compatible Paths on Labelled Point Sets.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017
Time-Space Trade-Off for Finding the <i>k</i>-Visibility Region of a Point in a Polygon.
Proceedings of the WALCOM: Algorithms and Computation, 2017

Exploring Increasing-Chord Paths and Trees.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016
Time-Space Trade-off for Finding the k-Visibility Region of a Point in a Polygon.
CoRR, 2016

Polygon Simplification by Minimizing Convex Corners.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015
Drawing Graphs Using Body Gestures.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015


  Loading...