An optimal algorithm computing edge-to-edge visibility in a simple polygon
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Standard
An optimal algorithm computing edge-to-edge visibility in a simple polygon. / Abrahamsen, Mikkel.
Proceedings of the 25th Canadian Conference on Computational Geometry: CCCG 2013. 2013. s. 157-162.Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Harvard
Abrahamsen, M 2013, An optimal algorithm computing edge-to-edge visibility in a simple polygon. i Proceedings of the 25th Canadian Conference on Computational Geometry: CCCG 2013. s. 157-162, Canadian Conference on Computational Geometry 2013, Waterloo, Ontario, Canada, 08/08/2013. <http://cccg.ca/proceedings/2013/papers/paper_34.pdf>
APA
Abrahamsen, M. (2013). An optimal algorithm computing edge-to-edge visibility in a simple polygon. I Proceedings of the 25th Canadian Conference on Computational Geometry: CCCG 2013 (s. 157-162) http://cccg.ca/proceedings/2013/papers/paper_34.pdf
Vancouver
Abrahamsen M. An optimal algorithm computing edge-to-edge visibility in a simple polygon. I Proceedings of the 25th Canadian Conference on Computational Geometry: CCCG 2013. 2013. s. 157-162
Author
Bibtex
@inproceedings{8804d8132f694e1c850f09b3de9bfc5f,
title = "An optimal algorithm computing edge-to-edge visibility in a simple polygon",
author = "Mikkel Abrahamsen",
year = "2013",
language = "English",
pages = "157--162",
booktitle = "Proceedings of the 25th Canadian Conference on Computational Geometry",
note = "null ; Conference date: 08-08-2013 Through 10-08-2013",
}
RIS
TY - GEN
T1 - An optimal algorithm computing edge-to-edge visibility in a simple polygon
AU - Abrahamsen, Mikkel
N1 - Conference code: 25
PY - 2013
Y1 - 2013
M3 - Article in proceedings
SP - 157
EP - 162
BT - Proceedings of the 25th Canadian Conference on Computational Geometry
Y2 - 8 August 2013 through 10 August 2013
ER -
ID: 168856071