On the complexity of minimum-link path problems

Research output: Research - peer-reviewArticle in proceedings

Documents

DOI

  • Irina Kostitsyna
    Irina KostitsynaDept. of Mathematics and Computer ScienceTU Eindhoven
  • Maarten Löffler
    Maarten LöfflerDept. of Computing and Information SciencesUtrecht University
  • Valentin Polishchuk
    Valentin PolishchukLinköping University
  • Frank Staals
    Frank Staals
Original languageEnglish
Title of host publication32nd International Symposium on Computational Geometry, SoCG 2016
EditorsSándor Fekete, Anna Lubiw
Number of pages16
Volume51
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Publication year1 Jun 2016
Pages49.1-49.16
ISBN (Electronic)9783959770095
DOIs
StatePublished - 1 Jun 2016
Event32nd International Symposium on Computational Geometry, SoCG 2016 - Boston, United States
Duration: 14 Jun 201617 Jun 2016

Conference

Conference32nd International Symposium on Computational Geometry, SoCG 2016
LandUnited States
ByBoston
Periode14/06/201617/06/2016
Sponsoret al., National Science Foundation (NSF), Princeton University, The Center for Geometry and its Applications (SRC-GAIA), The Fields Institute for Research in Mathematical Sciences, Tufts University
SeriesLeibniz International Proceedings in Informatics
Volume51
ISSN1868-8969

    Research areas

  • Bit complexity, Diffuse reflection, Minimum-link path, NP-hardness, Terrain

See relations at Aarhus University Citationformats

ID: 108797013