Follow
Alireza Zarei
Alireza Zarei
Department of Mathematical Sciences, Sharif University of Technology
Verified email at Sharif.ir - Homepage
Title
Cited by
Cited by
Year
Streaming algorithms for line simplification
MA Abam, M De Berg, P Hachenberger, A Zarei
Discrete & Computational Geometry 43 (3), 497-515, 2010
642010
Efficient computation of query point visibility in polygons with holes
A Zarei, M Ghodsi
Proceedings of the twenty-first annual symposium on Computational geometry …, 2005
412005
Touring a sequence of disjoint polygons: Complexity and extension
A Ahadi, A Mozafari, A Zarei
Theoretical Computer Science 556, 45-54, 2014
222014
Query point visibility computation in polygons with holes
A Zarei, M Ghodsi
Computational Geometry 39 (2), 78-90, 2008
212008
A simple, faster method for kinetic proximity problems
Z Rahmati, MA Abam, V King, S Whitesides, A Zarei
Computational Geometry 48 (4), 342-359, 2015
152015
Kinetic Euclidean minimum spanning tree in the plane
Z Rahmati, A Zarei
Journal of Discrete Algorithms 16, 2-11, 2012
122012
Kinetic pie delaunay graph and its applications
MA Abam, Z Rahmati, A Zarei
Scandinavian Workshop on Algorithm Theory, 48-58, 2012
92012
Visibility testing and counting
S Alipour, A Zarei
Frontiers in Algorithmics and Algorithmic Aspects in Information and …, 2011
92011
Computing polygonal path simplification under area measures
S Daneshpajouh, M Ghodsi, A Zarei
Graphical models 74 (5), 283-289, 2012
82012
Weak visibility of two objects in planar polygonal scenes
M Nouri, A Zarei, M Ghodsi
International Conference on Computational Science and Its Applications, 68-81, 2007
82007
Touring disjoint polygons problem is NP-hard
A Ahadi, A Mozafari, A Zarei
International Conference on Combinatorial Optimization and Applications, 351-360, 2013
62013
Recognizing visibility graphs of triangulated irregular networks
H Boomari, M Ostovari, A Zarei
Fundamenta Informaticae 179 (4), 345-360, 2021
52021
Visibility testing and counting
S Alipour, M Ghodsi, A Zarei, M Pourreza
Information Processing Letters 115 (9), 649-654, 2015
52015
A practical approach for planar visibility maintenance
A Zarei, M Ghodsi
Journal for Geometry and Graphics 13 (1), 1-16, 2009
52009
Maintaining Visibility Polygon of a Moving Point Observer in Polygons with Holes
A Zarei, AA Khosravi, M Ghodsi
11th CSI Computer Conference (CSICC’2006), IPM School of Computer Science …, 2006
42006
Connecting guards with minimum Steiner points inside simple polygons
A Ahadi, A Zarei
Theoretical Computer Science 775, 26-31, 2019
22019
Recognizing visibility graphs of polygons with holes and internal-external visibility graphs of polygons
H Boomari, M Ostovari, A Zarei
arXiv preprint arXiv:1804.05105, 2018
22018
Combinatorial changes of euclidean minimum spanning tree of moving points in the plane.
Z Rahmati, A Zarei
CCCG, 43-45, 2010
22010
Separating colored points with minimum number of rectangles
N Assadian, SH Shanjani, A Zarei
arXiv preprint arXiv:2107.09821, 2021
12021
Visibility graphs of anchor polygons
H Boomari, A Zarei
International Conference on Topics in Theoretical Computer Science, 72-89, 2015
12015
The system can't perform the operation now. Try again later.
Articles 1–20