Minimizing Distance-to-Sight in Polygonal Domains

Oh, Eunjin

doi:10.4230/LIPIcs.ISAAC.2018.59

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Minimizing Distance-to-Sight in Polygonal Domains

MPS-Authors

/persons/resource/persons228565

Oh, Eunjin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

http://drops.dagstuhl.de/opus/volltexte/2018/10007/
(Publisher version)

http://drops.dagstuhl.de/doku/urheberrecht1.html
(Copyright transfer agreement)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Oh, E. (2018). Minimizing Distance-to-Sight in Polygonal Domains. In W.-L. Hsu, D.-T. Lee, & C.-S. Liao (Eds.), 29th International Symposium on Algorithms and Computation (pp. 1-12). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ISAAC.2018.59.

Cite as: https://hdl.handle.net/21.11116/0000-0002-AA7D-3

Abstract

There is no abstract available