Applied and computational complex analysis. Vol. 3: discrete Fourier analysis—Cauchy integrals—construction of conformal maps---univalent functions
Linear time algorithms for visibility and shortest path problems inside simple polygons
SCG '86 Proceedings of the second annual symposium on Computational geometry
A linear time algorithm with minimum link paths inside a simple polygon
Computer Vision, Graphics, and Image Processing
Planning, geometry, and complexity of robot motion
Planning, geometry, and complexity of robot motion
On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
Optimal shortest path queries in a simple polygon
SCG '87 Proceedings of the third annual symposium on Computational geometry
Complexity theory of real functions
Complexity theory of real functions
Computational Complexity of Two-Dimensional Regions
SIAM Journal on Computing
Computable analysis: an introduction
Computable analysis: an introduction
New results on shortest paths in three dimensions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Jordan Curves with Polynomial Inverse Moduli of Continuity
Electronic Notes in Theoretical Computer Science (ENTCS)
Jordan curves with polynomial inverse moduli of continuity
Theoretical Computer Science
On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
On the complexity of computing the logarithm and square root functions on a complex domain
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
The problem of finding a piecewise straight-line path, with a constant number of line segments, in a two-dimensional domain is studied in the Turing machine-based computational model and in the discrete complexity theory. It is proved that, for polynomial-time recognizable domains associated with polynomial-time computable distance functions, the complexity of this problem is equivalent to a discrete problem which is complete for @?"2^P, the second level of the polynomial-time hierarchy.