• Call: +98(35)31232715

4th Iranian Conference on Computational Geometry
(ICCG 2021)

February 18, 2021, Yazd University, Yazd, Iran

shape

The 4th Iranian Conference on Computational Geometry (ICCG) will be held on February 18, 2021 at the Department of Mathematical Sciences, at Yazd University, Yazd (listed as world heritage in UNESCO), Iran. ICCG is an annual conference whose goal is to bring together students and researchers from academia and industry, in order to promote research in the fields of combinatorial and computational geometry.

Important dates:

Submission deadline:

November 12, 2020
November 27, 2020

Acceptance notification:

December 12, 2020
December 20, 2020

Conference:

February 18, 2021


In order to facilitate more people to contribute to the conference, there will be an online session such that the authors can present their paper online. However, because of the COVID-19 situation, the whole conference may be held virtually.

Invited Speaker:

Committee:

General Chair:

  • Mohammad Farshi, Yazd University


Program Committee:

  • Mohammad Ali Abam, Sharif University of Technology
  • Hugo Akitaya, Carleton University
  • Elena Arseneva, St. Petersburg State University
  • Fatemeh Baharifard, IPM
  • Therese Biedl, University of Waterloo
  • Ahmad Biniaz, University of Windsor (co-chair)
  • Mark de Berg, Eindhoven University of Technology
  • Stephane Durocher, University of Manitoba
  • Amin Gheibi, Amirkabir University of Technology
  • Mahdieh Hasheminezhad, Yazd University
  • Shahin Kamali, University of Manitoba
  • Wolfgang Mulzer, Freie Universitat Berlin
  • Zahed Rahmati, Amirkabir University of Technology
  • Don Sheehy, North Carolina State University
  • Michiel Smid, Carleton University
  • Andre van Renssen, The University of Sydney
  • Alireza Zarei, Sharif University of Technology
  • Hamid Zarrabi-Zadeh, Sharif University of Technology (co-chair)
about

Submission Guidelines:

ICCG does not have formally reviewed proceedings. The results presented at ICCG could also be submitted to peer-reviewed conferences and/or journals. Papers that have been just submitted to other peer-reviewed events, conferences, or journals are eligible to be presented at ICCG.
We invite authors to submit their research works as extended abstracts that should not exceed four pages, and must be prepared with LaTeX, using our ICCG 2021 LaTeX template. The submission must be submitted through EasyChair

Program:

Note that because of the COVID-19 situation, the whole conference will be held virtually. The talks will be given online using Adobe Connect.

IRST

GMT

Authors

Title

13:50 10:20 Welcome (General Chair)

14

10:30

Christiane Schmidt

Guarding Polyominoes under $r$-Hop Visibility

14:25

10:55

Azadeh Tabatabaei, Mohammad Aletaha, Fardin Shapouri and Mohammad Ghodsi

Watchman Routes under Incidence Visibility Constraint in Convex Polygons

14:50

11:20

Mohammad Aletaha, Arash Vaezi, Mohammad Abouei Mehrizi and Mohammad Ghodsi

Simple Robot Free-Target Search in Rectilinear Streets

15:15

11:45

Vahideh Keikha, Hamidreza Keikha and Ali Mohades

Near-Linear Algorithms for the $k$-colored Rainbow Sets

15:40

12:10

Break

16

12:30

Davood Bakhshesh and Mohammad Farshi

A lower bound on the stretch factor of Yao graph $Y_4$

16:25

12:55

Mohammad Ali Abam and Mohammad Sadegh Borouny

Local geometric spanners for points in convex position

16:50

13:20

Abolfazl Poureidi and Mohammad Farshi

Spanners on imprecise points

17:15

13:45

Hugo Akitaya, Ahmad Biniaz and Prosenjit Bose

On the Spanning Ratio of the Directed $\Theta_6$-Graph

17:40

14:10

Hugo Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luis Fernando Schultz Xavier da Silveira and Michiel Smid

The Minimum Moving Spanning Tree Problem

18:5

14:35

Break

18:30

15

Sergey Bereg and Mohammadreza Haghpanah

Exploring the OT-graphs

18:55

15:25

Ahmad Biniaz

A short proof of the non-biplanarity of $K_9$

19:20

15:50

Anil Maheshwari

List of accepted papers:

  • Vahideh Keikha, Hamidreza Keikha and Ali Mohades. Near-Linear Algorithms for the $k$-colored Rainbow Sets
  • Ahmad Biniaz. A short proof of the non-biplanarity of $K_9$
  • Sergey Bereg and Mohammadreza Haghpanah. Exploring the OT-graphs
  • Hugo Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luis Fernando Schultz Xavier da Silveira and Michiel Smid. The Minimum Moving Spanning Tree Problem
  • Abolfazl Poureidi and Mohammad Farshi. Spanners on imprecise points
  • Davood Bakhshesh and Mohammad Farshi. A lower bound on the stretch factor of Yao graph $Y_4$
  • Christiane Schmidt. Guarding Polyominoes under $r$-Hop Visibility
  • Hugo Akitaya, Ahmad Biniaz and Prosenjit Bose. On the Spanning Ratio of the Directed $\Theta_6$-Graph
  • Mohammad Ali Abam and Mohammad Sadegh Borouny. Local geometric spanners for points in convex position
  • Mohammad Aletaha, Arash Vaezi, Mohammad Abouei Mehrizi and Mohammad Ghodsi. Simple Robot Free-Target Search in Rectilinear Streets
  • Azadeh Tabatabaei, Mohammad Aletaha, Fardin Shapouri and Mohammad Ghodsi. Watchman Routes under Incidence Visibility Constraint in Convex Polygons
  • Scopes

    Topics to be covered are all aspects of computational geometry, (but are not limited to) including:

    • Algorithmic methods in geometry

    • Experimental studies of geometric algorithms

    • Geometric modeling, visualization and simulation

    • Combinatorial optimization

    • Computational biology and geometric computations

    • Computer-aided design

    • Computer vision

    • Graph drawing

    • Geographic information systems

    • Robotics