### Abstract

An open question in Exact Geometric Computation is whether there are transcendental computations that can be made "geometrically exact". Perhaps the simplest such problem in computational geometry is that of computing the shortest obstacle-avoiding path between two points p, q in the plane, where the obstacles are a collection of n discs. This problem can be solved in O(n ^{2} log n) time in the Real RAM model, but nothing was known about its computability in the standard (Turing) model of computation. We first show the Turing-computability of this problem, provided the radii of the discs are rationally related. We make the usual assumption that the numerical input data are real algebraic numbers. By appealing to effective bounds from transcendental number theory, we further show a single-exponential time upper bound when the input numbers are rational. Our result appears to be the first example of a non-algebraic combinatorial problem which is shown computable. It is also a rare example of transcendental number theory yielding positive computational results.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the 21st Annual Symposium on Computational Geometry, SCG'05 |

Pages | 116-125 |

Number of pages | 10 |

State | Published - 2005 |

Event | 21st Annual Symposium on Computational Geometry, SCG'05 - Pisa, Italy Duration: Jun 6 2005 → Jun 8 2005 |

### Other

Other | 21st Annual Symposium on Computational Geometry, SCG'05 |
---|---|

Country | Italy |

City | Pisa |

Period | 6/6/05 → 6/8/05 |

### Fingerprint

### Keywords

- Disc obstacles
- Exact geometric computation
- Exponential complexity
- Guaranteed precision computation
- Real RAM model
- Robust numerical algorithms
- Shortest path

### ASJC Scopus subject areas

- Software
- Geometry and Topology
- Safety, Risk, Reliability and Quality
- Chemical Health and Safety

### Cite this

*Proceedings of the 21st Annual Symposium on Computational Geometry, SCG'05*(pp. 116-125)

**Shortest path amidst disc obstacles is computable.** / Chang, Ee Chien; Choi, Sung Woo; Kwon, DoYong; Park, Hyungju; Yap, Chee.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the 21st Annual Symposium on Computational Geometry, SCG'05.*pp. 116-125, 21st Annual Symposium on Computational Geometry, SCG'05, Pisa, Italy, 6/6/05.

}

TY - GEN

T1 - Shortest path amidst disc obstacles is computable

AU - Chang, Ee Chien

AU - Choi, Sung Woo

AU - Kwon, DoYong

AU - Park, Hyungju

AU - Yap, Chee

PY - 2005

Y1 - 2005

N2 - An open question in Exact Geometric Computation is whether there are transcendental computations that can be made "geometrically exact". Perhaps the simplest such problem in computational geometry is that of computing the shortest obstacle-avoiding path between two points p, q in the plane, where the obstacles are a collection of n discs. This problem can be solved in O(n 2 log n) time in the Real RAM model, but nothing was known about its computability in the standard (Turing) model of computation. We first show the Turing-computability of this problem, provided the radii of the discs are rationally related. We make the usual assumption that the numerical input data are real algebraic numbers. By appealing to effective bounds from transcendental number theory, we further show a single-exponential time upper bound when the input numbers are rational. Our result appears to be the first example of a non-algebraic combinatorial problem which is shown computable. It is also a rare example of transcendental number theory yielding positive computational results.

AB - An open question in Exact Geometric Computation is whether there are transcendental computations that can be made "geometrically exact". Perhaps the simplest such problem in computational geometry is that of computing the shortest obstacle-avoiding path between two points p, q in the plane, where the obstacles are a collection of n discs. This problem can be solved in O(n 2 log n) time in the Real RAM model, but nothing was known about its computability in the standard (Turing) model of computation. We first show the Turing-computability of this problem, provided the radii of the discs are rationally related. We make the usual assumption that the numerical input data are real algebraic numbers. By appealing to effective bounds from transcendental number theory, we further show a single-exponential time upper bound when the input numbers are rational. Our result appears to be the first example of a non-algebraic combinatorial problem which is shown computable. It is also a rare example of transcendental number theory yielding positive computational results.

KW - Disc obstacles

KW - Exact geometric computation

KW - Exponential complexity

KW - Guaranteed precision computation

KW - Real RAM model

KW - Robust numerical algorithms

KW - Shortest path

UR - http://www.scopus.com/inward/record.url?scp=33244462625&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33244462625&partnerID=8YFLogxK

M3 - Conference contribution

SP - 116

EP - 125

BT - Proceedings of the 21st Annual Symposium on Computational Geometry, SCG'05

ER -