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

• Submission deadline: November 10, 2018 Extended to November 20, 2018
• ​Acceptance notification: December 10, 2018 Extended to December 20, 2018
• Conference: February 19, 2019

Martin Nöllenburg

External Labeling: Models, Applications, and Geometric Algorithms

General chair:

• Alireza Zarei, Sharif University of Technology

Program committee:

• Mohammad Ali Abam, Sharif University of Technology (co-chair)
• Ahmad Biniaz, University of Waterloo, Canada
• Mohammad Farshi, Yazd University (co-chair)
• Mohammad Ghodsi, Sharif University of Technology, Iran
• Joachim Gudmundsson, The university of Sydney, Australia
• Shahin Kamali, University of Manitoba, Canada
• Philipp Kindermann, University of Waterloo, Canada
• Matias Korman, Tufts university, USA
• Maarten Löffler, Utrecht university, Netherlands
• Mehran Mehr, Eindhoven University of Technology, Netherlands
• Saeed Mehrabi, Carleton university, Canada
• Ali Mohades Khorasani, Amirkabir University of Technology, Iran
• Morteza Monemizadeh, Amazon, USA
• Martin Nöllenburg, Technische Universität Wien, Austria
• Jeff Philips, University of Utah, USA
• Zahed Rahmati, Amirkabir University of Technology, Iran
• Alireza Zarei, Sharif University of Technology, Iran
• Hamid Zarrabi-Zadeh, Sharif University of Technology, Iran

Local organizing committee:

• Alireza Zarei, Sharif University of Technology
• Hossein Boomari, Sharif University of Technology

• List of accepted papers
• Homa Ataei Kachooei, Mansoor Davoodi and Dena Tayebi. The p-center problem under Uncertainty
• Davood Bakhshesh and Mohammad Farshi. A Plane Region-Fault Tolerant 2.095-Spanner for Points in Convex Position
• Mohammad Ali Abam, Mark de Berg, Mehran Mehr and Mahnaz Ghaffari. Transmission radius games on wireless networks
• Afrouz Jabalameli and Hamid Zarrabi-Zadeh. On the Maximum Triangle Problem
• Hossein Boomari, Mojtaba Ostovari and Alireza Zarei Recognizing Visibility Graphs of TINs
• Zahed Rahmati, Sina Farahzad and Shervin Naseri. Counting Closed Billiard Paths
• Amir Mesrikhani and Mohammad Farshi. Solving the convex hull problem progressively in the external memory model
• Mohammad Asgaripour and Ali Mohades. Some Results on the Fewest Net of Simplicial Polyhedra
• Mohammad Ali Abam, Mohammad Sadegh Borouny and Azadeh Mousavi. Local Geometric Spanners
• Ali Gholami Rudi. Approximate Curve-Restricted Simplification of Polygonal Curves
• Homa Ataei Kachooei, Mansoor Davoodi and Dena Tayeby. On Maximum-Weight Minimum Spanning Tree Color-Spanning Set
• Azadeh Tabatabaei, Mohammad Ghodsi and Fardin Shapouri. Competitive Strategy for Walking in Streets for an Empowered Simple Robot
• Ali Gholami Rudi. Approximate Discontinuous Trajectory Hotspots
• The proceedings - The booklet of the accepted papers
• Schedule

Time Period	Description
08:30 - 9:30	Registration (Lobby of Computer Engineering Faculty)
09:30 - 10:30	Invited lecture
10:30 - 11:00	Break
11:00 - 12:20	Session 1 (Kharazmi conference room - 4th floor - Computer Engineering Faculty)
12:20 - 14:00	Lunch (Pardisan Refectory - 4th floor)
14:00 - 15:40	Session 2 (Kharazmi conference room - 4th floor - Computer Engineering Faculty)
15:40 - 16:00	Break
16:00 - 17:20	Session 3 (Kharazmi conference room - 4th floor - Computer Engineering Faculty)

• Session 1 (Chairs: Dr. Ghodsi, Dr. Rahmati)
  • 11:00 - 11:20: The p-center problem under Uncertainty
  • 11:20 - 11:40: A Plane Region-Fault Tolerant 2.095-Spanner for Points in Convex Position
  • 11:40 - 12:00: Transmission radius games on wireless networks
  • 12:00 - 12:20: On the Maximum Triangle Problem
• Session 2 (Chairs: Dr. Mohades, Dr. Zarrabi-Zadeh)
  • 14:00 - 14:20: Recognizing Visibility Graphs of TINs
  • 14:20 - 14:40: Counting Closed Billiard Paths
  • 14:40 - 15:00: Solving the convex hull problem progressively in the external memory model
  • 15:00 - 15:20: Some Results on the Fewest Net of Simplicial Polyhedra
  • 15:20 - 15:40: Local Geometric Spanners
• Session 3 (Chairs: Dr. Farshi, Dr. Abam)
  • 16:00 - 16:20: Approximate Curve-Restricted Simplification of Polygonal Curves
  • 16:20 - 16:40: Maximum-Weight Minimum Spanning Tree Color-Spanning Set
  • 16:40 - 17:00: Competitive Strategy for Walking in Streets for an Empowered Simple Robot
  • 17:00 - 17:20: Approximate Discontinuous Trajectory Hotspots

Online registration in now open. Early registration will be closed at 20-January 2019. There are two types of registrations specified in the table below. Each accepted paper must have at least one Regular Registration.

Fees

	Early Registration (before 20 January)	Late Registration (After 20 January)
Regular Registration	2,500,000 Rials	4,000,000 Rials
Student Registration	1,500,000 Rials	2,500,000 Rials

Register Here