Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon.

Y. Bahoo, B. Banyassady, P. Bose, S. Durocher, and W. Mulzer. WALCOM, volume 10167 of Lecture Notes in Computer Science, page 308-319. Springer, (2017)

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.

No persons found for author name Bahoo, Yeganeh

add a person with the name Bahoo, Yeganeh

Other publications of authors with the same name

Compatible Paths on Labelled Point Sets.E. Arseneva, Y. Bahoo, A. Biniaz, P. Cano, F. Chanchary, J. Iacono, K. Jain, A. Lubiw, D. Mondal, K. Sheikhan and 1 other author(s). CCCG, page 54-60. (2018)Exploring Increasing-Chord Paths and Trees.Y. Bahoo, S. Durocher, S. Mehrpour, and D. Mondal. CoRR, (2017)Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon.Y. Bahoo, B. Banyassady, P. Bose, S. Durocher, and W. Mulzer. WALCOM, volume 10167 of Lecture Notes in Computer Science, page 308-319. Springer, (2017)Polygon simplification by minimizing convex corners.Y. Bahoo, S. Durocher, J. Keil, D. Mondal, S. Mehrabi, and S. Mehrpour. Theor. Comput. Sci., (2019)Computing the k-Crossing Visibility Region of a Point in a Polygon.Y. Bahoo, P. Bose, S. Durocher, and T. Shermer. IWOCA, volume 11638 of Lecture Notes in Computer Science, page 10-21. Springer, (2019)Polygon Simplification by Minimizing Convex Corners.Y. Bahoo, S. Durocher, J. Keil, D. Mondal, S. Mehrabi, and S. Mehrpour. CoRR, (2018)Time-Space Trade-off for Finding the k-Visibility Region of a Point in a Polygon.Y. Bahoo, B. Banyassady, P. Bose, S. Durocher, and W. Mulzer. CoRR, (2016)A time-space trade-off for computing the k-visibility region of a point in a polygon.Y. Bahoo, B. Banyassady, P. Bose, S. Durocher, and W. Mulzer. Theor. Comput. Sci., (2019)Polygon Simplification by Minimizing Convex Corners.Y. Bahoo, S. Durocher, J. Keil, S. Mehrabi, S. Mehrpour, and D. Mondal. COCOON, volume 9797 of Lecture Notes in Computer Science, page 547-559. Springer, (2016)Drawing Graphs Using Body Gestures.Y. Bahoo, A. Bunt, S. Durocher, and S. Mehrpour. Graph Drawing, volume 9411 of Lecture Notes in Computer Science, page 561-562. Springer, (2015)

PUMA

Disambiguation of "Bahoo, Yeganeh"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon.

Please choose a person to relate this publication to

Other publications of authors with the same name

Disambiguation

PUMA

Disambiguation of "Bahoo, Yeganeh"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon.

Please choose a person to relate this publication to

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon.