On the Complexity of Finding Paths in a Two-Dimensional Domain II: Piecewise Straight-Line Paths-Reference-Cited by-同舟云学术

On the Complexity of Finding Paths in a Two-Dimensional Domain II: Piecewise Straight-Line Paths

Published:2005-02 Issue: Volume:120 Page:45-57
ISSN:1571-0661
Container-title:Electronic Notes in Theoretical Computer Science
language:en
Short-container-title:Electronic Notes in Theoretical Computer Science

Author:

Chou Arthur W.,Ko Ker-I

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference18 articles.

1. Computational complexity of two-dimensional regions;Chou;SIAM J. Comput.,1995

2. Chou, A.W. and Ko, K., On the complexity of finding paths in a two-dimensional domain I: shortest paths, Math. Logic Quarterly, to appear; also in Proc. International Conference on Computability and Complexity in Analysis, 2003, Informatik Berichte 302-8/2003, FernUniversität in Hagen, Hagen, Germany

3. Chou, A.W. and Ko, K., A note on the complexity of distance functions of two-dimensional domains, preprint

4. Theory of Computational Complexity;Du,2000

5. Linear time algorithms for visibility and shortest path problems inside simple polygons;Guibas,1986

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. In Memoriam: Ker-I Ko (1950–2018);Complexity and Approximation;2020

2. Who Asked Us? How the Theory of Computing Answers Questions about Analysis;Complexity and Approximation;2020

3. Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths;Mathematical Methods in the Applied Sciences;2014-09-29

4. On the complexity of computing the Hausdorff distance;Journal of Complexity;2013-06

5. Jordan Areas and Grids;Electronic Notes in Theoretical Computer Science;2008-12