Alireza Zarei

CoRR, 2023

2022

Visibility Graphs of Anchor Polygons.

[BibT_eX]

[DOI]

Hossein Boomari

J. Graph Algorithms Appl., 2022

Der SSH Open Marketplace - Kontextualisiertes Praxiswissen für die Digital Humanities.

[BibT_eX]

[DOI]

Proceedings of the 8. Tagung des Verbands Digital Humanities im deutschsprachigen Raum, 2022

2021

Recognizing Visibility Graphs of Triangulated Irregular Networks.

[BibT_eX]

[DOI]

Hossein Boomari

Mojtaba Ostovari

Fundam. Informaticae, 2021

Separating Colored Points with Minimum Number of Rectangles.

[BibT_eX]

[DOI]

Navid Assadian

Sima Hajiaghaei Shanjani

CoRR, 2021

2019

Connecting guards with minimum Steiner points inside simple polygons.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Pseudo-Triangle Visibility Graph: Characterization and Reconstruction.

[BibT_eX]

[DOI]

Sahar Mehrpour

CoRR, 2019

2018

Recognizing Visibility Graphs of Polygons with Holes and Internal-External Visibility Graphs of Polygons.

[BibT_eX]

[DOI]

Hossein Boomari

Mojtaba Ostovari

CoRR, 2018

2017

Touring Convex Polygons in Polygonal Domain Fences.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

When Diameter Matters: Parameterized Approximation Algorithms for Bounded Diameter Minimum Steiner Tree Problem.

[BibT_eX]

[DOI]

Ali Mashreghi

Theory Comput. Syst., 2016

2015

Visibility testing and counting.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

A simple, faster method for kinetic proximity problems.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Touring a Sequence of Line Segments in Polygonal Domain Fences.

[BibT_eX]

[DOI]

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014

Touring a sequence of disjoint polygons: Complexity and extension.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

All Approximating Segments for a Sequence of Points.

[BibT_eX]

[DOI]

Ghobad Emadi

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

Touring Disjoint Polygons Problem Is NP-Hard.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2013

2012

Kinetic Euclidean minimum spanning tree in the plane.

[BibT_eX]

[DOI]

Zahed Rahmati

J. Discrete Algorithms, 2012

Computing polygonal path simplification under area measures.

[BibT_eX]

[DOI]

Shervin Daneshpajouh

Graph. Model., 2012

Efficient Observer-Dependent Simplification in Polygonal Domains.

[BibT_eX]

[DOI]

Algorithmica, 2012

Kinetic Pie Delaunay Graph and Its Applications.

[BibT_eX]

[DOI]

Mohammad Ali Abam

Zahed Rahmati

Proceedings of the Algorithm Theory - SWAT 2012, 2012

Touring Polygons: An Approximation Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012

2011

Visibility Testing and Counting.

[BibT_eX]

[DOI]

Sharareh Alipour

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010

Streaming Algorithms for Line Simplification.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2010

A Probabilistic Method to Detect Anomalies in Embedded Systems.

[BibT_eX]

[DOI]

Mahroo Zandrahimi

Hamid R. Zarandi

Proceedings of the 25th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems, 2010

Combinatorial changes of euclidean minimum spanning tree of moving points in the plane.

[BibT_eX]

[DOI]

Zahed Rahmati

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2008

Query point visibility computation in polygons with holes.

[BibT_eX]

[DOI]

Comput. Geom., 2008

2007

Weak Visibility of Two Objects in Planar Polygonal Scenes.

[BibT_eX]

[DOI]

Mostafa Nouri

Proceedings of the Computational Science and Its Applications, 2007

Efficient Visibility Maintenance of a Moving Segment Observer inside a Simple Polygon.

[BibT_eX]

[DOI]

Amirali Khosravi

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2005

Efficient computation of query point visibility in polygons with holes.

[BibT_eX]

[DOI]