Covering Orthogonal Polygons with Sliding k-Transmitters

Submitted by admin on Sat, 04/30/2016 - 14:03

Title	Covering Orthogonal Polygons with Sliding k-Transmitters
Publication Type	Conference Paper
Year of Publication	2014
Authors	Mahdavi, Salma Sadat, Seddighin Saeed, and Ghodsi Mohammad
Conference Name	Proceedings of the 26th Canadian Conference on Computational Geometry, {CCCG} 2014, Halifax, Nova Scotia, Canada, 2014
URL	http://www.cccg.ca/proceedings/2014/papers/paper12.pdf

Google Scholar

Lastest Talks

Barrier resilience of visibility polygons

Zahra Momtazian

Abstract

In barrier resilience problems, we are given a set of barriers and two points $s$ and $t$. The task is to ﬁnd the minimum number of barriers one has to remove such that there is a path between $s$ and $t$ that does not cross a barrier.

2016-09-17 12:30

Useful links

Talks

Barrier resilience of visibility polygons

Join our Google Group Now!

GET IN TOUCH WITH US

Contact us

Sharif University of Technology, Department of Computer Engineering

Room 712, CE Algorithms Lab
P.O. Box 11155-9517, Tehran, Iran

Tel: +9821-6600-6675

Education - This is a contributing Drupal Theme
Design by WeebPal.

Search form