Alireza Zarei - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 28 from 28

2022

Visibility Graphs of Anchor PolygonsHossein Boomari, Alireza Zarei. jgaa, 26(1):15-34, 2022. [doi]

Der SSH Open Marketplace - Kontextualisiertes Praxiswissen für die Digital HumanitiesAlireza Zarei, Yim Seung-Bin, Matej Durco, Klaus Illmayer, Laure Barbot, Frank Fischer 0005, Edward Gray. dhd 2022: [doi]

2021

Recognizing Visibility Graphs of Triangulated Irregular NetworksHossein Boomari, Mojtaba Ostovari, Alireza Zarei. FUIN, 179(4):345-360, 2021. [doi]

2019

Connecting guards with minimum Steiner points inside simple polygonsArash Ahadi, Alireza Zarei. TCS, 775:26-31, 2019. [doi]

2017

Touring Convex Polygons in Polygonal Domain FencesArash Ahadi, Amirhossein Mozafari, Alireza Zarei. cocoa 2017: 61-75 [doi]

2016

When Diameter Matters: Parameterized Approximation Algorithms for Bounded Diameter Minimum Steiner Tree ProblemAli Mashreghi, Alireza Zarei. mst, 58(2):287-303, 2016. [doi]

2015

2014

Touring a sequence of disjoint polygons: Complexity and extensionArash Ahadi, Amirhossein Mozafari, Alireza Zarei. TCS, 556:45-54, 2014. [doi]

All Approximating Segments for a Sequence of PointsGhobad Emadi, Alireza Zarei. cccg 2014: [doi]

2013

Touring Disjoint Polygons Problem Is NP-HardArash Ahadi, Amirhossein Mozafari, Alireza Zarei. cocoa 2013: 351-360 [doi]

2012

2011

Visibility Testing and CountingSharareh Alipour, Alireza Zarei. AAIM 2011: 343-351 [doi]

Kinetic Euclidean Minimum Spanning Tree in the PlaneZahed Rahmati, Alireza Zarei. iwoca 2011: 261-274 [doi]

2010

Streaming Algorithms for Line SimplificationMohammad Ali Abam, Mark de Berg, Peter Hachenberger, Alireza Zarei. dcg, 43(3):497-515, 2010. [doi]

Combinatorial changes of euclidean minimum spanning tree of moving points in the planeZahed Rahmati, Alireza Zarei. cccg 2010: 43-45 [doi]

A Probabilistic Method to Detect Anomalies in Embedded SystemsMahroo Zandrahimi, Alireza Zarei, Hamid R. Zarandi. dft 2010: 152-159 [doi]

2008

Query point visibility computation in polygons with holesAlireza Zarei, Mohammad Ghodsi. comgeo, 39(2):78-90, 2008. [doi]

2007

Streaming algorithms for line simplificationMohammad Ali Abam, Mark de Berg, Peter Hachenberger, Alireza Zarei. compgeom 2007: 175-183 [doi]

Efficient Visibility Maintenance of a Moving Segment Observer inside a Simple PolygonAmirAli Khosravi, Alireza Zarei, Mohammad Ghodsi. cccg 2007: 249-252

Weak Visibility of Two Objects in Planar Polygonal ScenesMostafa Nouri, Alireza Zarei, Mohammad Ghodsi. iccsa 2007: 68-81 [doi]

2005

Efficient computation of query point visibility in polygons with holesAlireza Zarei, Mohammad Ghodsi. compgeom 2005: 314-320 [doi]

Sign in or sign up to see more results.

runs on WebDSL