Categories and Subject Descriptors: F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems -- geometrical problems and computations, routing and layout; G.1.6 [Numerical Analysis]: Optimization -- nonlinear programming; G.2.2 [Discrete Mathematics]: Graph Theory -- path and circuit problems; I.2.8 [Artificial Intelligence]: Problem Solving, Control Methods, and Search
Selected papers that cite this one
- James A. Storer and John H. Reif. Shortest paths in the plane with polygonal obstacles. Journal of the ACM, 41(5):982-1012, September 1994.
- Subir Kumar Ghosh and David M. Mount. An output sensitive algorithm for computing visibility graphs. In 28th Annual Symposium on Foundations of Computer Science, pages 11-19, Los Angeles, California, 12-14 October 1987. IEEE.