Near optimal line segment queries in simple polygons

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

Title	Near optimal line segment queries in simple polygons
Publication Type	Journal Article
Year of Publication	2015
Authors	Bygi, Mojtaba Nouri, and Ghodsi Mohammad
Journal	J. Discrete Algorithms
Volume	35
Pagination	51–61
URL	http://dx.doi.org/10.1016/j.jda.2015.10.002
DOI	10.1016/j.jda.2015.10.002

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