On the complexity of minimum-link path problems

keywords: Computational Geometry, Terrains

Journal Article (peer-reviewed)

Frank Staals, Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk
On the complexity of minimum-link path problems
Journal of Computational Geometry
8, 2, 80–108, 2017
http://dx.doi.org/10.20382/jocg.v8i2a5

Conference Proceedings (peer-reviewed)

Frank Staals, Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk
On the complexity of minimum-link path problems
Proc. 32nd International Symposium on Computational Geometry
51, 49:1–49:16, 2016
http://drops.dagstuhl.de/opus/volltexte/2016/5941
Invited to Special Issue of JoCG

Workshop or Poster (weakly reviewed)

Frank Staals, Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk
On the complexity of minimum-link path problems
Abstracts XVI Spanish Meeting on Computational Geometry
21–24, 2015

Archived Publication (not reviewed)

Frank Staals, Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk
On the complexity of minimum-link path problems
1603.06972, 2016
http://arXiv.org/abs/1603.06972

back to list