Publication

Found 5 results
Filters: Author is Sharareh Alipour  [Clear All Filters]
2016
An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem, Alipour, Sharareh, Ghodsi Mohammad, and Jafari Amir , Computing and Combinatorics - 22nd International Conference, {COCOON} 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings, p.209–221, (2016)
An improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem, Alipour, Sharareh, Ghodsi Mohammad, and Jafari Amir , CoRR, Volume abs/1605.03542, (2016)
2015
Visibility testing and counting, Alipour, Sharareh, Ghodsi Mohammad, Zarei Alireza, and Pourreza Maryam , Inf. Process. Lett., Volume 115, Number 9, p.649–654, (2015)
Weak visibility counting in simple polygons, Bygi, Mojtaba Nouri, Daneshpajouh Shervin, Alipour Sharareh, and Ghodsi Mohammad , J. Computational Applied Mathematics, Volume 288, p.215–222, (2015)
2014
An Approximation Algorithm for Computing the Visibility Region of a Point on a Terrain and Visibility Testing, Alipour, Sharareh, Ghodsi Mohammad, Güdükbay Ugur, and Golkari Morteza , {VISAPP} 2014 - Proceedings of the 9th International Conference on Computer Vision Theory and Applications, Volume 3, Lisbon, Portugal, 5-8 January, 2014, p.699–704, (2014)
 

Join our Google Group Now!



GET IN TOUCH WITH US

Contact us

Sharif University of Technology, Department of Computer Engineering

Room 712, CE Algorithms Lab
P.O. Box 11155-9517, Tehran, Iran

Tel: +9821-6616-6675

Education - This is a contributing Drupal Theme
Design by WeebPal.