( en | de | ru )

 

Disambiguation of "Bahoo, Yeganeh"

Author of the publication

copydeleteadd this publication to your clipboard
Computing the k-Crossing Visibility Region of a Point in a Polygon.

, , , and . IWOCA, volume 11638 of Lecture Notes in Computer Science, page 10-21. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Freidun Yeganeh

Hojatollah Yeganeh

Ardeshir Yeganeh

Susan Ehsani-Yeganeh

 

Other publications of authors with the same name

Compatible Paths on Labelled Point Sets., , , , , , , , , and 1 other author(s). CCCG, page 54-60. (2018)Compatible Paths on Labelled Point Sets., , , , , , , , , and 1 other author(s). CoRR, (2020)Arithmetic Billiard Paths Revisited: Escaping from a Rectangular Room., , , and . MMAR, page 478-483. IEEE, (2023)Segment Visibility for k-Transmitters., , and . ALGOWIN, volume 14061 of Lecture Notes in Computer Science, page 1-12. Springer, (2023)Polygon Simplification by Minimizing Convex Corners., , , , , and . COCOON, volume 9797 of Lecture Notes in Computer Science, page 547-559. Springer, (2016)Drawing Graphs Using Body Gestures., , , and . GD, volume 9411 of Lecture Notes in Computer Science, page 561-562. Springer, (2015)DPPE: Dense Pose Estimation in a Plenoxels Environment using Gradient Approximation., , and . CoRR, (2024)Bouncing Robots in Rectilinear Polygons., , and . MMAR, page 193-198. IEEE, (2022)Computing the k-Crossing Visibility Region of a Point in a Polygon., , , and . IWOCA, volume 11638 of Lecture Notes in Computer Science, page 10-21. Springer, (2019)Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon., , , , and . WALCOM, volume 10167 of Lecture Notes in Computer Science, page 308-319. Springer, (2017)