Geometric Shortest Paths and Network Optimization

[1]  R. Ravi,et al.  A nearly best-possible approximation algorithm for node-weighted Steiner trees , 1993, IPCO.

[2]  Neil C. Rowe.  Obtaining Optimal Mobile-Robot Paths with Nonsmooth Anisotropic Cost Functions Using Qualitative-State Reasoning , 1997, Int. J. Robotics Res..

[3]  Danny Ziyi Chen,et al.  Shortest path queries among weighted obstacles in the rectilinear plane , 1995, SCG '95.

[4]  Michiel H. M. Smid,et al.  On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees , 1996, Algorithmica.

[5]  Stéphane Rivière.  Topologically sweeping the visibility complex of polygonal scenes , 1995, SCG '95.

[6]  Wei-Pand Chin,et al.  Shortest watchman routes in simple polygons , 1990, Discret. Comput. Geom..

[7]  Michiel H. M. Smid,et al.  Lower bounds for computing geometric spanners and approximate shortest paths , 1996, Discret. Appl. Math..

[8]  Santosh S. Vempala,et al.  Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen , 1995, STOC '95.

[9]  John F. Canny,et al.  Using skeletons for nonholonomic path planning among obstacles , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[10]  Sung Yong Shin,et al.  New competitive strategies for searching in unknown star-shaped polygons , 1997, SCG '97.

[11]  Mark H. Overmars,et al.  New methods for computing visibility graphs , 1988, SCG '88.

[12]  Ioannis G. Tollis,et al.  Path planning in the presence of vertical obstacles , 1990, IEEE Trans. Robotics Autom..

[13]  D. T. Lee,et al.  Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.

[14]  M. Bauer,et al.  Triangulations , 1996, Discret. Math..

[15]  Edmund Ihler,et al.  The rectilinear class Steiner tree problem for intervals on two parallel lines , 1994, Math. Program..

[16]  Robert E. Tarjan,et al.  Scaling and related techniques for geometry problems , 1984, STOC '84.

[17]  Simeon C. Ntafos,et al.  Optimum watchman routes , 1986, SCG '86.

[18]  Jürgen Sellen,et al.  Direction weighted shortest path planning , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[19]  Esther M. Arkin,et al.  On the maximum scatter TSP , 1997, SODA '97.

[20]  Nageswara S. V. Rao,et al.  Robot navigation in an unexplored terrain , 1986, J. Field Robotics.

[21]  Pravin M. Vaidya.  A fast approximation for minimum spanning trees in k-dimensional space , 1984, FOCS.

[22]  Boris Aronov.  On the geodesic Voronoi diagram of point sites in a simple polygon , 1987, SCG '87.

[23]  Joseph S. B. Mitchell,et al.  An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane , 1997, Discret. Comput. Geom..

[24]  Jörg-Rüdiger Sack,et al.  An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces , 1998, SWAT.

[25]  Chak-Kuen Wong,et al.  Rectilinear Paths Among Rectilinear Obstacles , 1992, Discret. Appl. Math..

[26]  Guy Desaulniers.  On shortest paths for a car-like robot maneuvering around obstacles , 1996, Robotics Auton. Syst..

[27]  Luca Trevisan,et al.  When Hamming meets Euclid: the approximability of geometric TSP and MST (extended abstract) , 1997, STOC '97.

[28]  Sanjiv Kapoor,et al.  Efficient computation of geodesic shortest paths , 1999, STOC '99.

[29]  Alexander I. Barvinok,et al.  Two Algorithmic Results for the Traveling Salesman Problem , 1996, Math. Oper. Res..

[30]  Rolf Klein.  Walking an Unknown Street with Bounded Detour , 1991, Comput. Geom..

[31]  Joseph S. B. Mitchell,et al.  Bicriteria Shortest Path Problems in the Plane ( extended abstract ) , 2022 .

[32]  Sándor P. Fekete,et al.  Area optimization of simple polygons , 1993, SCG '93.

[33]  Richard Cole,et al.  River Routing Every Which Way, but Loose (Extended Abstract) , 1984, FOCS.

[34]  Bala Kalyanasundaram,et al.  Constructing Competitive Tours from Local Information , 1993, Theor. Comput. Sci..

[35]  Leila De Floriani,et al.  Applications of Computational Geometry to Geographic Information Systems , 2000, Handbook of Computational Geometry.

[36]  Hongyan Wang,et al.  Nonuniform Discretization for Kinodynamic Motion Planning and its Applications , 2000, SIAM J. Comput..

[37]  Esther M. Arkin,et al.  Angewandte Mathematik Und Informatik Universit at Zu K Oln Approximation Algorithms for Lawn Mowing and Milling Ss Andor P.fekete Center for Parallel Computing Universitt at Zu Kk Oln D{50923 Kk Oln Germany Approximation Algorithms for Lawn Mowing and Milling , 2022 .

[38]  David S. Johnson,et al.  The Complexity of Computing Steiner Minimal Trees , 1977 .

[39]  Philip N. Klein,et al.  Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..

[40]  Giri Narasimhan,et al.  Resource-constrained geometric network optimization , 1998, SCG '98.

[41]  John Hershberger.  Optimal parallel algorithms for triangulated simple polygons , 1995, Int. J. Comput. Geom. Appl..

[42]  Micha Sharir,et al.  On shortest paths in polyhedral spaces , 1986, STOC '84.

[43]  Sunil Arya,et al.  A 2.5-Factor Approximation Algorithm for the k-MST Problem , 1998, Inf. Process. Lett..

[44]  Ricardo A. Baeza-Yates,et al.  Searching in the Plane , 1993, Inf. Comput..

[45]  Subhash Suri,et al.  Curvature-Constrained Shortest Paths in a Convex Polygon , 2002, SIAM J. Comput..

[46]  Joseph O'Rourke,et al.  Vertex-edge pseudo-visibility graphs: characterization and recognition , 1997, SCG '97.

[47]  John Hershberger,et al.  A New Data Structure for Shortest Path Queries in a Simple Polygon , 1991, Inf. Process. Lett..

[48]  Margaret K. Guyder.  Automating the optimization of 2 1 2 axis milling , 1990 .

[49]  Andrew Lim,et al.  Optimal Rectilinear Steiner Tree for Extremal Point Sets , 1993, ISAAC.

[50]  Danny Z. Chen,et al.  Deterministic Parallel Computational Geometry , 2000, Handbook of Computational Geometry.

[51]  Danny Ziyi Chen,et al.  Rectilinear Short Path Queries Among Rectangular Obstacles , 1996, Inf. Process. Lett..

[52]  Subir Kumar Ghosh,et al.  On recognizing and characterizing visibility graphs of simple polygons , 1988, SWAT.

[53]  Subhash Suri,et al.  Matrix searching with the shortest path metric , 1993, SIAM J. Comput..

[54]  Tak Wah Lam,et al.  An on-line algorithm for navigating in unknown environment , 1993, Int. J. Comput. Geom. Appl..

[55]  Andrew Chi-Chih Yao,et al.  On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems , 1977, SIAM J. Comput..

[56]  H. Rohnert.  New algorithms for shortest paths avoiding convex polygonal obstacles , 1986 .

[57]  John F. Canny,et al.  An exact algorithm for kinodynamic planning in the plane , 1990, SCG '90.

[58]  Edmund Ihler,et al.  Bounds on the quality of approximate solutions to the Group Steiner Problem , 1990, WG.

[59]  Chandrajit L. Bajaj,et al.  The algebraic degree of geometric optimization problems , 1988, Discret. Comput. Geom..

[60]  Vladimir J. Lumelsky,et al.  A comparative study on the path length performance of maze-searching and robot motion planning algorithms , 1991, IEEE Trans. Robotics Autom..

[61]  S. Sitharama Iyengar,et al.  Robot navigation algorithms using learned spatial graphs , 1986, Robotica.

[62]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[63]  Amos Fiat,et al.  Randomized robot navigation algorithms , 1996, SODA '96.

[64]  John Hershberger,et al.  An Efficient Solution to the Zookeeper's Problem , 1994, CCCG.

[65]  Ming-Yang Kao,et al.  Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem , 1996, SODA '93.

[66]  Leonidas J. Guibas,et al.  Optimal shortest path queries in a simple polygon , 1987, SCG '87.

[67]  Joseph O'Rourke.  Finding A Shortest Ladder Path: A Special Case , 1987 .

[68]  Mark H. Overmars,et al.  Motion Planning for Carlike Robots Using a Probabilistic Learning Approach , 1997, Int. J. Robotics Res..

[69]  J. Sellen.  Planning paths of minimal curvature , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[70]  Alejandro López-Ortiz,et al.  Generalized Streets Revisited , 1996, ESA.

[71]  Alejandro López-Ortiz,et al.  Going Home Through an Unknown Street , 1995, WADS.

[72]  Simeon C. Ntafos,et al.  Watchman Routes Under Limited Visibility , 1991, Comput. Geom..

[73]  Hazel Everett,et al.  The Aquarium Keeper's Problem , 1991, SODA '91.

[74]  Alejandro L opez-Ortizy,et al.  Simple, Eecient and Robust Strategies to Traverse Streets , 1995 .

[75]  Rolf Klein,et al.  The polygon exploration problem: a new strategy and a new analysis technique , 1998 .

[76]  Sándor P. Fekete,et al.  Simplicity and hardness of the maximum traveling salesman problem under geometric distances , 1999, SODA '99.

[77]  Esther M. Arkin,et al.  Computing a shortest k-link path in a polygon , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[78]  Hans Rohnert,et al.  Shortest Paths in the Plane with Convex Polygonal Obstacles , 1986, Inf. Process. Lett..

[79]  Alok Aggarwal,et al.  The angular-metric traveling salesman problem , 1997, SODA '97.

[80]  Micha Sharir,et al.  Approximating shortest paths on a convex polytope in three dimensions , 1997, JACM.

[81]  Naveen Garg,et al.  A 3-approximation for the minimum tree spanning k vertices , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[82]  Mikhail J. Atallah,et al.  On Parallel Rectilinear Obstacle- Avoiding Paths , 1993, Comput. Geom..

[83]  Mark de Berg,et al.  Shortest path queries in rectilinear worlds , 1992, Int. J. Comput. Geom. Appl..

[84]  Gerhard Reinelt,et al.  Fast Heuristics for Large Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..

[85]  Subhash Suri,et al.  Practical methods for approximating shortest paths on a convex polytope in R3 , 1995, SODA '95.

[86]  Mikhail J. Atallah,et al.  Parallel rectilinear shortest paths with rectangular obstacles , 1990, SPAA '90.

[87]  Boris Aronov,et al.  Star Unfolding of a Polytope with Applications , 1997, SIAM J. Comput..

[88]  Esther M. Arkin,et al.  Approximation Algorithms for the Geometric Covering Salesman Problem , 1994, Discret. Appl. Math..

[89]  Gerhard J. Woeginger,et al.  The Maximum Traveling Salesman Problem Under Polyhedral Norms , 1998, IPCO.

[90]  Edmund Ihler,et al.  On Shortest Networks for Classes of Points in the Plane , 1991, Workshop on Computational Geometry.

[91]  John Hershberger,et al.  Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract) , 1991, WADS.

[92]  D. T. Lee,et al.  Efficient Computation of the Geodesic Voronoi Diagram of Points in a Simple Polygon (Extended Abstract) , 1995, ESA.

[93]  Bengt J. Nilsson,et al.  Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms , 1997, FCT.

[94]  Pierre Hansen,et al.  Bicriterion Path Problems , 1980 .

[95]  G. Rinaldi,et al.  Chapter 4 The traveling salesman problem , 1995 .

[96]  Michael T. Goodrich,et al.  Dynamic ray shooting and shortest paths via balanced geodesic triangulations , 1993, SCG '93.

[97]  James A. Storer,et al.  A single-exponential upper bound for finding shortest paths in three dimensions , 1994, JACM.

[98]  Micha Sharir,et al.  Computing the geodesic center of a simple polygon , 1989, Discret. Comput. Geom..

[99]  R. Ravi,et al.  A polylogarithmic approximation algorithm for the group Steiner tree problem , 2000, SODA '98.

[100]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

[101]  C. E. Veni Madhavan,et al.  Shortest Watchman Tours in Weak Visibility Polygons , 1993, CCCG.

[102]  Mark de Berg,et al.  Shortest path queries in rectilinear worlds of higher dimension (extended abstract) , 1991, SCG '91.

[103]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[104]  Tomio Hirata,et al.  Corrigendum to "An Incremental Algorithm for Constructing Shortest Watchman Routes" , 1991, Int. J. Comput. Geom. Appl..

[105]  Xuemin Lin,et al.  Performance Guarantees for Motion Planning with Temporal Uncertainty , 1993, Aust. Comput. J..

[106]  Boris Aronov,et al.  Nonoverlap of the star unfolding , 1991, SCG '91.

[107]  Jon M. Kleinberg,et al.  On-line search in a simple polygon , 1994, SODA '94.

[108]  Bengt J. Nilsson,et al.  Minimum Spanning Trees in d Dimensions , 1999, Nord. J. Comput..

[109]  Der-Tsai Lee.  Proximity and reachability in the plane. , 1978 .

[110]  Manuel Blum,et al.  On the power of the compass (or, why mazes are easier to search than graphs) , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[111]  L. Dubins.  On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .

[112]  Clyde L. Monma,et al.  Computing euclidean maximum spanning trees , 1988, SCG '88.

[113]  Xiaotie Deng,et al.  How to learn an unknown environment. I: the rectilinear case , 1998, JACM.

[114]  Subhash Suri,et al.  An Optimal Algorithm for Euclidean Shortest Paths in the Plane , 1999, SIAM J. Comput..

[115]  David M. Mount,et al.  An Output Sensitive Algorithm for Computing Visibility Graphs , 1987, FOCS.

[116]  Sven Schuierer.  Lower Bounds in On-Line Geometric Searching , 1997, FCT.

[117]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[118]  David Eppstein,et al.  Shortest paths in an arrangement with k line orientations , 1999, SODA '99.

[119]  Jean-Paul Laumond,et al.  Feasible Trajectories for Mobile Robots with Kinematic and Environment Constraints , 1986, IAS.

[120]  Christos Levcopoulos,et al.  Quasi-greedy triangulations approximating the minimum weight triangulation , 1996, SODA '96.

[121]  Refael Hassin,et al.  An Approximation Algorithm for the Maximum Traveling Salesman Problem , 1998, Inf. Process. Lett..

[122]  Michael T. Goodrich,et al.  Geometric Data Structures , 2000, Handbook of Computational Geometry.

[123]  S. Rao Kosaraju,et al.  Faster algorithms for some geometric graph problems in higher dimensions , 1993, SODA '93.

[124]  Michel Pocchiola,et al.  Computing the visibility graph via pseudo-triangulations , 1995, SCG '95.

[125]  C. Bajaj.  The Algebraic Complexity of Shortest Paths in Polyhedral Spaces , 1985 .

[126]  Joseph C. Culberson,et al.  Turtlegons: generating simple polygons for sequences of angles , 1985, SCG '85.

[127]  Chak-Kuen Wong,et al.  Rectilinear Path Problems among Rectilinear Obstacles Revisited , 1995, SIAM J. Comput..

[128]  William Warntz,et al.  Transportation, Social Physics, And The Law Of Refraction , 1957 .

[129]  L. Shepp,et al.  OPTIMAL PATHS FOR A CAR THAT GOES BOTH FORWARDS AND BACKWARDS , 1990 .

[130]  Chee Yap,et al.  Rectilinear geodesics in 3-space , 1995 .

[131]  Joseph S. B. Mitchell,et al.  Separation and approximation of polyhedral objects , 1992, SODA '92.

[132]  Joachim Gudmundsson,et al.  A Fast Approximation Algorithm for TSP with Neighborhoods , 1999, Nord. J. Comput..

[133]  Chak-Kuen Wong,et al.  On Some Distance Problems in Fixed Orientations , 1987, SIAM J. Comput..

[134]  Madhu Sudan,et al.  The minimum latency problem , 1994, STOC '94.

[135]  Baruch Schieber,et al.  Fast geometric approximation techniques and geometric embedding problems , 1989, SCG '89.

[136]  Micha Sharir,et al.  Arrangements and Their Applications , 2000, Handbook of Computational Geometry.

[137]  Alejandro López-Ortiz,et al.  Position-independent near optimal searching and on-line recognition in star polygons , 1997, SCG '97.

[138]  Kurt Mehlhorn,et al.  On continuous Homotopic one layer routing , 1988, SCG '88.

[139]  Nageswara,et al.  On Terrain Model Acquisition by a Point Robot Amidst Polyhedral Obstacles , 1981 .

[140]  Pravin M. Vaidya,et al.  Geometry helps in matching , 1989, STOC '88.

[141]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

[142]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[143]  Sudipto Guha,et al.  Approximation algorithms for directed Steiner problems , 1999, SODA '98.

[144]  David P. Williamson,et al.  Computational experience with an approximation algorithm on large-scale Euclidean matching instances , 1994, SODA '94.

[145]  Sariel Har-Peled,et al.  Approximate shortest paths and geodesic diameters on convex polytopes in three dimensions , 1997, SCG '97.

[146]  V. Lumelsky,et al.  Algorithmic issues of sensor-based robot motion planning , 1987, 26th IEEE Conference on Decision and Control.

[147]  Amos Fiat,et al.  Online Navigation in a Room , 1992, J. Algorithms.

[148]  Hongyan Wang,et al.  The complexity of the two dimensional curvature-constrained shortest-path problem , 1998 .

[149]  Gabriele Reich,et al.  Beyond Steiner's Problem: A VLSI Oriented Generalization , 1989, WG.

[150]  Simeon C. Ntafos,et al.  Watchman Routes in the Presence of a Pair of Convex Polygons , 1998, Inf. Sci..

[151]  Alejandro López-Ortiz,et al.  Walking Streets Faster , 1996, SWAT.

[152]  Joseph S. B. Mitchell,et al.  Chapter 7 A survey of computational geometry , 1995 .

[153]  John Hershberger,et al.  Finding the visibility graph of a simple polygon in time proportional to its size , 1987, SCG '87.

[154]  Hoon Liong Ong.  Approximate algorithms for the travelling purchaser problem , 1982, Oper. Res. Lett..

[155]  Gabriel Y. Handler,et al.  A dual algorithm for the constrained shortest path problem , 1980, Networks.

[156]  Alex Zelikovsky,et al.  Provably good routing tree construction with multi-port terminals , 1997, ISPD '97.

[157]  Otfried Cheong,et al.  Euclidean minimum spanning trees and bichromatic closest pairs , 1990, SCG '90.

[158]  Ovidiu Daescu,et al.  On Geometric Path Query Problems , 1997, Int. J. Comput. Geom. Appl..

[159]  Neil C. Rowe,et al.  Path planning by optimal-path-map construction for homogeneous-cost two-dimensional regions , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[160]  Ding-Zhu Du,et al.  The state of the art in Steiner ratio problems , 1992 .

[161]  Sariel Har-Peled,et al.  Constructing approximate shortest path maps in three dimensions , 1998, SCG '98.

[162]  Xiaotie Deng,et al.  How to learn an unknown environment , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[163]  François G. Pin,et al.  Time-Optimal Trajectories for Mobile Robots With Two Independently Driven Wheels , 1994, Int. J. Robotics Res..

[164]  D. Eppstein,et al.  Approximation algorithms for geometric problems , 1996 .

[165]  Jeffrey S. Salowe.  Constructing multidimensional spanner graphs , 1991, Int. J. Comput. Geom. Appl..

[166]  Petr Slavik,et al.  The Errand Scheduling Problem , 1997 .

[167]  Tetsuo Asano,et al.  Visibility in the Plane , 2000, Handbook of Computational Geometry.

[168]  Kenneth L. Clarkson,et al.  Approximation algorithms for shortest path motion planning , 1987, STOC.

[169]  Piotr Berman,et al.  On-line Searching and Navigation , 1996, Online Algorithms.

[170]  Danny Ziyi Chen,et al.  On the all-pairs Euclidean short path problem , 1995, SODA '95.

[171]  Bala Kalyanasundaram,et al.  On-line Network Optimization Problems , 1996, Online Algorithms.

[172]  Avrim Blum,et al.  An on-line algorithm for improving performance in navigation , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[173]  Makoto Imase,et al.  Dynamic Steiner Tree Problem , 1991, SIAM J. Discret. Math..

[174]  Chi-Keung Tang,et al.  A Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets , 1995, ISAAC.

[175]  Christopher Umans,et al.  Hamiltonian cycles in solid grid graphs , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[176]  Amitava Datta,et al.  Competitive searching in a generalized street , 1994, SCG '94.

[177]  Roberto Tamassia,et al.  A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps , 1996, SODA '93.

[178]  Mark de Berg,et al.  Trekking in the Alps Without Freezing or Getting Tired , 1993, ESA.

[179]  R. G. Parker,et al.  Guaranteed performance heuristics for the bottleneck travelling salesman problem , 1984 .

[180]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[181]  Christos H. Papadimitriou,et al.  An Algorithm for Shortest-Path Motion in Three Dimensions , 1985, Inf. Process. Lett..

[182]  Rolf Klein,et al.  Searching for the kernel of a polygon—a competitive strategy , 1995, SCG '95.

[183]  Franz Aurenhammer,et al.  Handbook of Computational Geometry , 2000 .

[184]  D. T. Lee,et al.  Shortest rectilinear paths among weighted obstacles , 1990, SCG '90.

[185]  Pankaj K. Agarwal,et al.  Approximating shortest paths on a nonconvex polyhedron , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[186]  Sven Schuierer,et al.  An optimal data structure for shortest rectilinear path queries in a simple rectilinear polygon , 1996, Int. J. Comput. Geom. Appl..

[187]  Joseph S. B. Mitchell,et al.  Approximation algorithms for geometric tour and network design problems (extended abstract) , 1995, SCG '95.

[188]  Micha Sharir,et al.  On shortest paths amidst convex polyhedra , 1987, SCG '86.

[189]  Bernard Chazelle,et al.  A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[190]  Svante Carlsson,et al.  Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons , 1991, WADS.

[191]  Svante Carlsson,et al.  Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time , 1995, WADS.

[192]  Jörg-Rüdiger Sack,et al.  Link Distance Problems , 2000, Handbook of Computational Geometry.

[193]  Joseph S. B. Mitchell,et al.  Two-point Euclidean shortest path queries in the plane , 1999, SODA '99.

[194]  David P. Williamson,et al.  A note on the prize collecting traveling salesman problem , 1993, Math. Program..

[195]  Paul Chew,et al.  There are Planar Graphs Almost as Good as the Complete Graph , 1989, J. Comput. Syst. Sci..

[196]  Edmund Ihler,et al.  The Complexity of Approximating the Class Steiner Tree Problem , 1991, WG.

[197]  Mark R. Kindl,et al.  A stochastic approach to the weighted-region problem : 1. the design of the path annealing algorithm , 1991 .

[198]  David G. Kirkpatrick,et al.  Approximating Shortest Paths in Arrangements of Lines , 1996, CCCG.

[199]  Subir Kumar Ghosh,et al.  Optimal On-line Algorithms for Walking with Minimum Number of Turns in Unknown Streets , 1997, Comput. Geom..

[200]  Chee-Keng Yap,et al.  Approximate Euclidean Shortest Paths in 3-Space , 1997, Int. J. Comput. Geom. Appl..

[201]  Marshall W. Bern,et al.  The Steiner Problem with Edge Lengths 1 and 2 , 1989, Inf. Process. Lett..

[202]  Gordon T. Wilfong.  Shortest paths for autonomous vehicles , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[203]  Sariel Har-Peled,et al.  Fly cheaply: on the minimum fuel-consumption problem , 1998, SCG '98.

[204]  Joseph S. B. Mitchell,et al.  Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems , 1999, SIAM J. Comput..

[205]  Leonidas J. Guibas,et al.  Approximating Polygons and Subdivisions with Minimum Link Paths , 1991, Int. J. Comput. Geom. Appl..

[206]  Joonsoo Choi.  Geodesic problems in high dimensions , 1996 .

[207]  Amitava Datta,et al.  Competitive Searching in Polygons - Beyond Generalised Streets , 1995, ISAAC.

[208]  Robert E. Tarjan,et al.  Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation , 1988, CACM.

[209]  Cor A. J. Hurkens.  Nasty TSP Instances for Farthest Insertion , 1992, IPCO.

[210]  David Eppstein,et al.  Spanning Trees and Spanners , 2000, Handbook of Computational Geometry.

[211]  Prabhakar Raghavan,et al.  The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection , 1994, ISAAC.

[212]  V. Lumelsky,et al.  Dynamic path planning for a mobile automaton with limited information on the environment , 1986 .

[213]  Joseph O'Rourke,et al.  Computing the geodesic diameter of a 3-polytope , 1989, SCG '89.

[214]  Santosh S. Vempala,et al.  A constant-factor approximation for the k-MST problem in the plane , 1995, STOC '95.

[215]  Dorit S. Hochbaum,et al.  An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane , 1994, STOC '94.

[216]  Robert E. Tarjan,et al.  Finding Minimum Spanning Trees , 1976, SIAM J. Comput..

[217]  J. MacGregor Smith,et al.  Computational Geometry and Topological Network Design , 1992 .

[218]  Pankaj K. Agarwal,et al.  Motion planning for a steering-constrained robot through moderate obstacles , 1995, STOC '95.

[219]  Noga Alon,et al.  On-line steiner trees in the Euclidean plane , 1992, SCG '92.

[220]  Micha Sharir,et al.  Motion Planning in the Presence of Moving Obstacles , 1985, FOCS.

[221]  Avrim Blum,et al.  An Online Algorithm for Improving Performance in Navigation , 2000, SIAM J. Comput..

[222]  Binay K. Bhattacharya,et al.  Efficient Approximate Shortest-Path Queries Among Isothetic Rectangular Obstacles , 1993, WADS.

[223]  John H. Reif,et al.  Parallel Computational Geometry: An Approach using Randomization , 2000, Handbook of Computational Geometry.

[224]  David Eppstein.  Faster Geometric K-point MST Approximation , 1997, Comput. Geom..

[225]  Pravin M. Vaidya,et al.  Minimum Spanning Trees in k-Dimensional Space , 1988, SIAM J. Comput..

[226]  Mariette Yvinec,et al.  Convex Tours on Bounded Curvature , 1994, ESA.

[227]  J. Reif,et al.  Approximate Kinodynamic Planning Using L2-norm Dynamic Bounds , 1990 .

[228]  Daniel J. Rosenkrantz,et al.  An Analysis of Several Heuristics for the Traveling Salesman Problem , 1977, SIAM J. Comput..

[229]  Boris Aronov,et al.  The furthest-site geodesic voronoi diagram , 1993, SCG '88.

[230]  Sudipto Guha,et al.  Rounding via Trees : Deterministic Approximation Algorithms forGroup , 1998 .

[231]  Esther M. Arkin,et al.  Optimization Problems Related to Zigzag Pocket Machining , 1996, SODA '96.

[232]  Franz Aurenhammer,et al.  Voronoi Diagrams , 2000, Handbook of Computational Geometry.

[233]  Christos H. Papadimitriou,et al.  The Euclidean Traveling Salesman Problem is NP-Complete , 1977, Theor. Comput. Sci..

[234]  Amitava Datta,et al.  Path Planning with Local Information , 1988, FSTTCS.

[235]  John F. Canny,et al.  Planning smooth paths for mobile robots , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[236]  R. S. Alexander.  CONSTRUCTION OF OPTIMAL-PATH MAPS FOR HOMOGENEOUS-COST-REGION PATH-PLANNING PROBLEMS , 1989 .

[237]  Christian Icking.  Motion and visibility in simple polygons , 1994 .

[238]  Joseph S. B. Mitchell,et al.  An Algorithmic Approach to Some Problems in Terrain Navigation , 1988, Artif. Intell..

[239]  Santosh S. Vempala,et al.  New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen , 1999, SIAM J. Comput..

[240]  J. Canny,et al.  Nonholonomic Motion Planning , 1992 .

[241]  Kenneth L. Clarkson,et al.  Rectilinear shortest paths through polygonal obstacles in O(n(logn)2) time , 1987, SCG '87.

[242]  D. T. Lee,et al.  Minimal Link Visibility Paths Inside a Simple Polygon , 1993, Comput. Geom..

[243]  Noga Alon,et al.  Long non-crossing configurations in the plane , 1993, SCG '93.

[244]  Michel Pocchiola,et al.  The visibility complex , 1993, SCG '93.

[245]  Esther M. Arkin,et al.  The Lawnmower Problem , 1993, Canadian Conference on Computational Geometry.

[246]  Mark de Berg,et al.  On Rectilinear Link Distance , 1991, Comput. Geom..

[247]  Sui-Wing Cheng.  The Steiner tree problem for terminals on the boundary of a rectilinear polygon , 2000, Theor. Comput. Sci..

[248]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[249]  Anastassios N. Perakis,et al.  Minimal Time Vessel Routing in a Time-Dependent Environment , 1989, Transp. Sci..

[250]  M. I. Henig.  The shortest path problem with two objective functions , 1986 .

[251]  Vladimir J. Lumelsky,et al.  Algorithmic and complexity issues of robot motion in an uncertain environment , 1987, J. Complex..

[252]  L. Paul Chew,et al.  Planning the shortest path for a disc in O(n2log n) time , 1985, SCG '85.

[253]  Pankaj K. Agarwal,et al.  Approximation algorithms for curvature-constrained shortest paths , 1996, SODA '96.

[254]  J. O'Rourke.  Uniqueness of Orthogonal Connect-the-Dots , 1988 .

[255]  Yoshihide Igarashi,et al.  An Efficient Strategy for Robot Navigation in Unknown Environment , 1994, Inf. Process. Lett..

[256]  Matteo Fischetti,et al.  Weighted k-cardinality trees: Complexity and polyhedral structure , 1994, Networks.

[257]  S. Sitharama Iyengar,et al.  On terrain acquisition by a point robot amidst polyhedral obstacles , 1988, IEEE J. Robotics Autom..

[258]  Gerhard J. Woeginger,et al.  Angle-Restricted Tours in the Plane , 1997, Comput. Geom..

[259]  Kenneth L. Clarkson.  Fast expected-time and approximation algorithms for geometric minimum spanning trees , 1984, STOC '84.

[260]  Bala Kalyanasundaram,et al.  Not All Insertion Methods Yield Constant Approximate Tours in the Euclidean Plane , 1994, Theor. Comput. Sci..

[261]  Gordon T. Wilfong,et al.  Planning constrained motion , 1988, STOC '88.

[262]  Reuven Bar-Yehuda,et al.  Triangulating disjoint Jordan chains , 1994, Int. J. Comput. Geom. Appl..

[263]  Simeon C. Ntafos,et al.  The Robber Route Problem , 1990, Inf. Process. Lett..

[264]  Chee-Keng Yap,et al.  Precision-Sensitive Euclidean Shortest Path in 3-Space , 2000, SIAM J. Comput..

[265]  Bernard Chazelle,et al.  Triangulating a simple polygon in linear time , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[266]  Joonsoo Choi,et al.  Monotonicity of rectilinear geodesics in d-space , 1996, SoCG 1996.

[267]  Baruch Schieber,et al.  Navigating in Unfamiliar Geometric Terrain , 1997, SIAM J. Comput..

[268]  Andrzej Lingas,et al.  Parallel algorithms for rectilinear link distance problems , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

[269]  David W. Payton,et al.  Planning and reasoning for autonomous vehicle control , 1987 .

[270]  Nageswara S. V. Rao.  Algorithmic framework for learned robot navigation in unknown terrains , 1989, Computer.

[271]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

[272]  Svante Carlsson,et al.  Finding the Shortest Watchman Route in a Simple Polygon , 1993, ISAAC.

[273]  Sanjeev Arora,et al.  Nearly linear time approximation schemes for Euclidean TSP and other geometric problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[274]  Joseph S. B. Mitchell,et al.  The weighted region problem: finding shortest paths through a weighted planar subdivision , 1991, JACM.

[275]  Clifford Stein,et al.  Long tours and short superstrings , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[276]  Leonidas J. Guibas,et al.  An O(n²) Shortest Path Algorithm for a Non-Rotating Convex Body , 1988, J. Algorithms.

[277]  Pankaj K. Agarwal,et al.  Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions , 1991, Comput. Geom..

[278]  Subhash Suri,et al.  Efficient computation of Euclidean shortest paths in the plane , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[279]  Rolf Klein,et al.  A competitive strategy for learning a polygon , 1997, SODA '97.

[280]  Tomio Hirata,et al.  Shortest Safari Routes in Simple Polygon , 1994, ISAAC.

[281]  A. Zelikovsky.  Better approximation bounds for the network and Euclidean Steiner tree problems , 1996 .

[282]  H. Alt,et al.  Visibility graphs and obstacle-avoiding shortest paths , 1988, ZOR Methods Model. Oper. Res..

[283]  Jörg-Rüdiger Sack,et al.  Approximating weighted shortest paths on polyhedral surfaces , 1997, SCG '97.

[284]  H. Sussmann.  Shortest 3-dimensional paths with a prescribed curvature bound , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.

[285]  Charles E. Leiserson,et al.  Algorithms for routing and testing routability of planar VLSI layouts , 1985, STOC '85.

[286]  Michel Pocchiola,et al.  Topologically sweeping visibility complexes via pseudotriangulations , 1996, Discret. Comput. Geom..

[287]  Pinaki Mitra,et al.  Orthogonal shortest route queries among axis parallel rectangular obstacles , 1994, Int. J. Comput. Geom. Appl..

[288]  Micha Sharir,et al.  A Note on the Papadimitriou-Silverberg Algorithm for Planning Optimal Piecewise-Linear Motion of a Ladder , 2019, Inf. Process. Lett..

[289]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[290]  Gordon T. Wilfong.  Motion planning for an autonomous vehicle , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[291]  Joseph S. B. Mitchell,et al.  Shortest paths among obstacles in the plane , 1993, SCG '93.

[292]  Santosh S. Vempala,et al.  A Constant-Factor Approximation Algorithm for the Geometric k-MST Problem in the Plane , 1999, SIAM J. Comput..

[293]  Pravin M. Vaidya,et al.  AnO(n logn) algorithm for the all-nearest-neighbors Problem , 1989, Discret. Comput. Geom..

[294]  David M. Mount,et al.  The Number of Shortest Paths on the Surface of a Polyhedron , 1990, SIAM J. Comput..

[295]  Tomio Hirata,et al.  Constructing Shortest Watchman Routes by Divide-and-Conquer , 1993, ISAAC.

[296]  Yossi Azar.  Lower Bounds for Insertion Methods for TSP , 1994, Comb. Probab. Comput..

[297]  M. Iri,et al.  Polygonal Approximations of a Curve — Formulations and Algorithms , 1988 .

[298]  Emo WELZL,et al.  Constructing the Visibility Graph for n-Line Segments in O(n²) Time , 1985, Inf. Process. Lett..

[299]  Bala Kalyanasundaram,et al.  A Competitive Analysis of Algorithms for Searching Unknown Scenes , 1993, Comput. Geom..

[300]  Tetsuo Asano,et al.  d1-optimal motion for a rod (extended abstract) , 1996, SCG '96.

[301]  Martin Held,et al.  On the Computational Geometry of Pocket Machining , 1991, Lecture Notes in Computer Science.

[302]  Joseph G. Peters,et al.  Smallest paths in simple rectilinear polygons , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[303]  Mikkel Thorup,et al.  Undirected single source shortest paths in linear time , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[304]  Joseph S. B. Mitchell,et al.  Path planning in 0/1/ weighted regions with applications , 1988, SCG '88.

[305]  D. T. Lee,et al.  Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon , 1995, Inf. Process. Lett..

[306]  S. N. Maheshwari,et al.  Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles , 1988, SCG '88.

[307]  Joseph S. B. Mitchell,et al.  Guillotine subdivisions approximate polygonal subdivisions: a simple new method for the geometric k-MST problem , 1996, SODA '96.

[308]  John F. Canny,et al.  New lower bound techniques for robot motion planning problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[309]  Esther M. Arkin,et al.  Logarithmic-time link path queries in a simple polygon , 1995, Int. J. Comput. Geom. Appl..

[310]  Tetsuo Asano,et al.  Clustering algorithms based on minimum and maximum spanning trees , 1988, SCG '88.

[311]  Rajeev Raman,et al.  Recent results on the single-source shortest paths problem , 1997, SIGA.

[312]  Joseph S. B. Mitchell,et al.  The Discrete Geodesic Problem , 1987, SIAM J. Comput..

[313]  Yijie Han,et al.  Shortest paths on a polyhedron , 1990, SCG '90.

[314]  James Abello,et al.  Visibility Graphs and Oriented Matroids , 1994, GD.

[315]  Subhash Suri,et al.  A pedestrian approach to ray shooting: shoot a ray, take a walk , 1993, SODA '93.

[316]  Jürgen Sellen,et al.  Approximation and decision algorithms for curvature-constrained path planning: a state-space approach , 1998 .

[317]  Jon M. Kleinberg,et al.  An improved approximation ratio for the minimum latency problem , 1996, SODA '96.

[318]  Anastassios N. Perakis,et al.  Deterministic Minimal Time Vessel Routing , 1990, Oper. Res..

[319]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[320]  Hongyan Wang,et al.  On-Line Navigation Through Weighted Regions , 1993 .

[321]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

[322]  F. Hwang.  On Steiner Minimal Trees with Rectilinear Distance , 1976 .

[323]  Jon Jouis Bentley,et al.  Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..

[324]  Michiel H. M. Smid,et al.  Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane , 1996, ESA.

[325]  Richard M. Murray,et al.  A motion planner for nonholonomic mobile robots , 1994, IEEE Trans. Robotics Autom..