Joseph S.B. Mitchell  Home/Search
Context Related
| sunysb.edu/pub/geomet...surveysp.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: sunysb.edu/~jsbm/publications (more) Homepages: J.Mitchell |
Rate this article:      (best)Comment on this article |
Abstract: Introduction A natural and well-studied problem in algorithmic graph theory and network optimization is that of computing a "shortest path" between two nodes, s and t, in a graph whose edges have "weights" associated with them, and we consider the "length" of a path to be the sum of the weights of the edges that comprise it. Efficient algorithms are well known for this problem, as briefly summarized below. The shortest path problem takes on a new dimension when considered in a geometric domain. ... (Update)
Cited by: More
Two-Point Euclidean Shortest Path Queries in the Plane - Exte Nd Ed (Correct)
Randolphs Robot Game is NP-complete! - Engels, Kamphans (2006) (Correct)
On the Complexity of Randolph's Robot Game - Engels, Kamphans (2005) (Correct)
Active bibliography (related documents): More All
2.5: On Geometric Path Query Problems - Chen, Daescu, Klenk (1997) (Correct)
2.1: Approximation Algorithms For Geometric Problems - Bern, Eppstein (1995) (Correct)
2.0: Rectilinear Paths among Rectilinear Obstacles - Lee, Yang, Wong (1996) (Correct)
Similar documents based on text: More All
0.0: On Parallelizable Eigensolvers - Auslander, Tsao (1992) (Correct)
0.0: Extending a Method of Devising Software Contracts - Mitchell, McKim (Correct)
0.0: Fast Estimation of Diameter and Shortest Paths.. - Aingworth.. (1996) (Correct)
Related documents from co-citation: More All
14: Guillotine subdivisions approximate polygonal subdivisions: A simple new method .. - Mitchell - 1996
13: Shortest paths and networks (context) - Mitchell - 1997
10: line searching and navigation (context) - Berman - 1998
BibTeX entry: (Update)
J. S. B. Mitchell. Geometric shortest paths and network optimization. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry. Elsevier Science, Amsterdam, 1998, to appear. http://citeseer.ist.psu.edu/mitchell98geometric.html More
@misc{ mitchell98geometric,
author = "J. Mitchell",
title = "Geometric shortest paths and network optimization",
text = "J. S. B. Mitchell. Geometric shortest paths and network optimization. In
J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry.
Elsevier Science, Amsterdam, 1998, to appear.",
year = "1998",
url = "citeseer.ist.psu.edu/mitchell98geometric.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NPCom.. (context) - Garey, Johnson - 1979
3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
1254 Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
625 Kluwer Academic Publishers (context) - Latombe, Planning - 1991
370 Network Flows: Theory (context) - Ahuja, Magnanti et al. - 1993
354 A note on two problems in connexion with graphs (context) - Dijkstra - 1959
353 Fibonacci heaps and their uses in improved network optimizat.. (context) - Fredman, Tarjan - 1987
300 the hardness of approximating minimization problems (context) - Lund, Yannakakis - 1994
266 Heuristics: Intelligent Search Strategies for Computer Probl.. (context) - Pearl - 1984
193 The Traveling Salesman Problem (context) - Lawler, Lenstra et al. - 1985
187 Polynomial time approximation schemes for Euclidean TSP and .. - Arora - 1996
180 Triangulating a simple polygon in linear time (context) - Chazelle - 1991
160 General approximation technique for constrained forest probl.. - Goemans, Williamson - 1992
127 Guillotine subdivisions approximate polygonal subdivisions: .. - Mitchell - 1996
127 Guillotine subdivisions approximate polygonal subdivisions: .. - Mitchell - 1997
127 Guillotine subdivisions approximate polygonal subdivisions: .. - Mitchell - 1998
113 New lower bound techniques for robot motion planning problem.. (context) - Canny, Reif - 1987
111 Optimal paths for a car that goes both forwards and backward.. (context) - Reeds, Shepp - 1990
106 On curves of minimal length with a constraint on average cur.. (context) - Dubins - 1957
94 A motion planner for nonholonomic mobile robots (context) - Laumond, Jacobs et al. - 1994
88 Linear-time algorithms for visibility and shortest path prob.. (context) - Guibas, Hershberger et al. - 1987
86 Provably good approximation algorithms for optimal kinodynam.. - Donald, Xavier - 1995
83 Navigating in unfamiliar geometric terrain - Blum, Raghavan et al. - 1997
80 Nonholonomic multi-body mobile robots: controllability and m.. (context) - Barraquand, Latombe - 1993
79 Motion planning in the presence of moving obstacles - Reif, Sharir - 1994
79 Path-planning strategies for a point mobile automaton moving.. (context) - Lumelsky, Stepanov - 1987
78 Fast algorithms for geometric traveling salesman problems (context) - Bentley - 1992
75 Dynamic Steiner tree problem (context) - Imase, Waxman - 1991
74 On constructing minimum spanning trees in k-dimensional spac.. (context) - Yao - 1982
74 Shortest paths without a map (context) - Papadimitriou, Yannakakis - 1991
68 Steiner minimal trees (context) - Gilbert, Pollak - 1968
63 Ray shooting in polygons using geodesic triangulations (context) - Chazelle, Edelsbrunner et al. - 1991
61 The discrete geodesic problem (context) - Mitchell, Mount et al. - 1987
61 The Steiner problem with edge lengths 1 and (context) - Bern, Plassman - 1989
58 A pedestrian approach to ray shooting: Shoot a ray (context) - Hershberger, Suri - 1995
57 Planning smooth paths for mobile robots (context) - Jacobs, Canny - 1989
57 Planning smooth paths for mobile robots (context) - Jacobs, Canny - 1992
57 Some algebraic and geometric computations in PSPACE (context) - Canny - 1988
57 Scaling and related techniques for geometry problems (context) - Gabow, Bentley et al. - 1984
55 Walking an unknown street with bounded detour (context) - Klein - 1992
54 Nearly linear time approximation schemes for Euclidean TSP a.. - Arora - 1997
53 Relaxed heaps: An alternative to Fibonacci heaps with applic.. (context) - Driscoll, Gabow et al. - 1988
53 A theorem on polygon cutting with applications (context) - Chazelle - 1982
52 An analysis of several heuristics for the traveling salesman.. (context) - Rosenkrantz, Stearns et al. - 1977
51 The minimum latency problem - Blum, Chalasani et al. - 1994
50 Euclidean shortest paths in the presence of rectilinear barr.. (context) - Lee, Preparata - 1984
50 On Steiner minimal trees with rectilinear distance (context) - Hwang - 1976
50 An improved approximation ratio for the minimum latency prob.. - Goemans, Kleinberg - 1996
50 On shortest paths in polyhedral spaces (context) - Sharir, Schorr - 1986
50 Approximation algorithms for geometric problems - Bern, Eppstein - 1997
48 The complexity of computing Steiner minimal trees (context) - Garey, Graham et al. - 1977
48 Spanning trees and spanners - Eppstein - 1998
48 the Computational Geometry of Pocket Machining (context) - Held - 1991
48 Approximation algorithms for directed Steiner problems - Charikar, Chekuri et al. - 1998
48 Approximation algorithms for geometric tour and network desi.. - Mata, Mitchell - 1995
47 approximation for the minimum tree spanning k vertices (context) - Garg - 1996
46 How to learn an unknown environment I: the rectilinear case - Deng, Kameda et al. - 1993
46 Approximation algorithms for shortest path motion planning - Clarkson - 1987
46 Optimal shortest path queries in a simple polygon (context) - Guibas, Hershberger - 1989
45 approximation algorithm for the network Steiner problem (context) - Zelikovsky - 1993
45 How to learn an unknown environment (context) - Deng, Kameda et al. - 1991
44 Rounding via tree: Deterministic approximation algorithms fo.. - Charikar, Chekuri et al. - 1998
43 Improved approximation guarantees for minimumweight k-trees .. - Awerbuch, Azar et al. - 1995
42 An output-sensitive algorithm for computing visibility graph.. (context) - Ghosh, Mount - 1991
42 algorithm for the all-nearest-neighbors problem (context) - Vaidya, log - 1989
42 The visibility complex (context) - Pocchiola, Vegter - 1993
41 An algorithm for shortest-path motion in three dimensions (context) - Papadimitriou - 1985
41 An exact algorithm for kinodynamic planning in the plane (context) - Canny, Rege et al. - 1991
41 Nonholonomic Motion Planning (context) - Li, Canny - 1992
40 Faster algorithms for some geometric graph problems in highe.. - Callahan, Kosaraju - 1993
39 Faster shortest-path algorithms for planar graphs - Henzinger, Klein et al. - 1997
38 The prize collecting traveling salesman problem (context) - Balas - 1989
38 Feasible trajectories for mobile robots with kinematic and e.. (context) - Laumond - 1986
38 Euclidean minimum spanning trees and bichromatic closest pai.. (context) - Agarwal, Edelsbrunner et al. - 1991
37 Finding minimum spanning trees (context) - Cheriton, Tarjan - 1976
37 A polylogarithmic approximation algorithm for the group Stei.. - Garg, Konjevod et al. - 1998
36 Voronoi diagrams - Aurenhammer, Klein - 1998
35 Searching in an unknown environment: An optimal randomized a.. - Kao, Reif et al. - 1993
35 The traveling salesman problem (context) - Junger, Reinelt et al. - 1995
34 Kinodynamic motion planning - Donald, Xavier et al. - 1993
34 Constructing the visibility graph for n line segments in O (context) - Welzl - 1985
33 minimum spanning tree problem in the plane (context) - Garg, Hochbaum et al. - 1994
33 A constant-factor approximation for the k-MST problem in the.. (context) - Blum, Chalasani et al. - 1995
33 Topologically sweeping visibility complexes via pseudo-trian.. - Pocchiola, Vegter - 1996
32 Dynamic path planning for a mobile automaton with limited in.. (context) - Lumelsky, Stepanov - 1986
32 line search in a simple polygon - Kleinberg - 1994
31 Searching for the kernel of a polygon: A competitive strateg.. - Icking, Klein - 1995
31 The weighted region problem: finding shortest paths through .. (context) - Mitchell, Papadimitriou - 1991
30 Competitive searching in a generalized street - Datta, Icking - 1994
30 A nearly best-possible approximation algorithm for node-weig.. - Klein, Ravi - 1995
29 Shortest paths among obstacles in the plane (context) - Mitchell - 1996
29 Shortest paths on a polyhedron (context) - Chen, Han - 1990
29 Shortest paths among obstacles in the plane (context) - Mitchell - 1993
29 Long tours and short superstrings (context) - Kosaraju, Park et al. - 1994
28 Approximating polygons and subdivisions with minimum link pa.. - Guibas, Hershberger et al. - 1993
28 Approximating weighted shortest paths on polyhedral surfaces - Lanthier, Maheshwari et al. - 1997
28 Polygonal approximations of a curve-formulations and algorit.. (context) - Imai, Iri - 1988
28 New methods for computing visibility graphs - Overmars, Welzl - 1988
27 Shortest paths and networks (context) - Mitchell - 1997
27 A note on the prize collecting traveling salesman problem (context) - Bienstock, Goemans et al. - 1993
27 When Hamming meets Euclid: The approximability of geometric .. - Trevisan - 1997
27 Randomized robot navigation algorithms - Berman, Blum et al. - 1996
26 line algorithm for improving performance in navigation - Blum, Chalasani - 1993
26 Dynamic ray shooting and shortest paths via balanced geodesi.. (context) - Goodrich, Tamassia - 1993
26 Geometry helps in matching (context) - Vaidya - 1989
26 Visibility of disjoint polygons (context) - Asano, Asano et al. - 1986
25 Motion planning for car-like robots using a probabilistic le.. - Svestka, Overmars - 1997
25 Searching in the plane (context) - Baeza-Yates, Culberson et al. - 1993
25 why mazes are easier to search than graphs (context) - Blum, Kozen et al. - 1978
25 Computing minimum length paths of a given homotopy class - Hershberger, Snoeyink - 1994
25 Planning constrained motion (context) - Fortune, Wilfong - 1991
25 line Steiner trees in the Euclidean plane - Alon, Azar - 1993
25 Algorithms for routing and testing routability of planar VLS.. (context) - Leiserson, Maley - 1985
25 Beyond Steiner's problem: A VLSI oriented generalization (context) - Reich, Widmayer - 1989
24 A dual algorithm for the constrained shortest path problem (context) - Handler, Zang - 1980
24 There are planar graphs almost as good as the complete graph (context) - Chew - 1989
24 Rectilinear shortest paths through polygonal obstacles in O - Clarkson, Kapoor et al. - 1987
24 Motion-planning with inertial constraints (context) - 'O'D'unlaing - 1987
24 Constructing multidimensional spanner graphs (context) - Salowe - 1991
23 Shortest paths for the Reeds-Shepp car: A worked out example.. (context) - Sussmann, Tang - 1991
23 Motion planning for a steering-constrained robot through mod.. (context) - Agarwal, Raghavan et al. - 1995
23 cardinality trees: Complexity and polyhedral structure (context) - Fischetti, Hamacher et al. - 1994
22 Clustering algorithms based on minimum and maximum spanning .. (context) - Asano, Bhattacharya et al. - 1988
22 Approximate Euclidean shortest paths in 3-space - Choi, Sellen et al. - 1997
22 CRC Press LLC (context) - Goodman, O'Rourke et al. - 1997
22 Using skeletons for nonholonomic path planning among obstacl.. - Mirtich, Canny - 1992
21 Star unfolding of a polytope with applications - Agarwal, Aronov et al. - 1997
21 Undirected single source shortest path in linear time - Thorup - 1997
20 Approximation algorithms for the geometric covering salesman.. - Arkin, Hassin - 1994
20 Better approximation bounds for the network and Euclidean St.. - Zelikovsky - 1996
20 Lower bounds for computing geometric spanners and approximat.. - Chen, Das et al. - 1996
19 Spanning trees short and small (context) - Ravi, Sundaram et al. - 1994
19 line searching and navigation (context) - Berman - 1998
19 The algebraic degree of geometric optimization problems (context) - Bajaj - 1988
19 Motion planning for an autonomous vehicle (context) - Wilfong - 1988
18 A new algorithm for computing shortest paths in weighted pla.. - Mata, Mitchell - 1997
18 A unified approach to dynamic point location (context) - Chiang, Preparata et al. - 1993
18 A unified approach to dynamic point location (context) - Chiang, Preparata et al. - 1996
18 Optimum watchman routes (context) - Chin, Ntafos - 1988
18 Competitive searching in polygons -- Beyond generalised stre.. (context) - Datta, Hipke et al. - 1995
18 Efficient computation of Euclidean shortest paths in the pla.. (context) - Hershberger, Suri - 1993
18 A competitive strategy for learning a polygon (context) - Hoffmann, Icking et al. - 1997
17 Watchman routes under limited visibility (context) - Ntafos - 1992
17 River routing every which way (context) - Cole, Siegel - 1984
17 Constructing competitive tours from local information - Kalyanasundaram, Pruhs - 1994
17 Approximation algorithms for lawn mowing and milling - Arkin, Fekete et al. - 1997
17 Quasi-greedy triangulations approximating the minimum weight.. - Levcopoulos, Krznaric - 1996
16 Recent results on the single-source shortest paths problem (context) - Raman - 1997
16 Approximate shortest paths on a convex polytope in three dim.. (context) - Agarwal, Har-Peled et al. - 1997
16 Provably good routing tree construction with multi-port term.. - Bateman, Helvig et al. - 1997
16 Generalized streets revisited (context) - L'opez-Ortiz, Schuierer - 1996
15 On some distance problems in fixed orientations (context) - Widmayer, Wu et al. - 1987
15 Bounds on the quality of approximate solutions to the group .. - Ihler - 1991
15 The lawnmower problem (context) - Arkin, Fekete et al. - 1993
15 Computing the visibility graph via pseudo-triangulations - Pocchiola, Vegter - 1995
15 Fast heuristics for large geometric traveling salesman probl.. (context) - Reinelt - 1992
14 An algorithmic approach to some problems in terrain navigati.. (context) - Mitchell - 1991
14 Bicriterion path problems (context) - Hansen - 1980
14 Algorithmic and complexity issues of robot motion in an unce.. (context) - Lumelsky - 1987
14 line algorithm for navigating in unknown environment (context) - Chan, Lam - 1993
14 maximum spanning trees and related problems in higher dimens.. (context) - Agarwal, Matousek et al. - 1992
14 Practical methods for approximating shortest paths on a conv.. - Hershberger, Suri - 1995
14 with applications to automatic optical inspection (context) - Iwano, Raghavan et al. - 1994
14 Separation and approximation of polyhedral objects (context) - Mitchell, Suri - 1995
14 An incremental algorithm for constructing shortest watchman .. (context) - Tan, Hirata et al. - 1998
14 An incremental algorithm for constructing shortest watchman .. (context) - Tan, Hirata et al. - 1993
14 Algorithmic framework for learned robot navigation in unknow.. (context) - Rao - 1989
14 Rectilinear paths among rectilinear obstacles - Lee, Yang et al. - 1996
14 An efficient algorithm for Euclidean shortest paths among po.. - Kapoor, Maheshwari et al. - 1997
14 Efficient algorithms for Euclidean shortest path and visibil.. - Kapoor, Maheshwari - 1988
13 parallel methods for visibility and shortest path problems i.. (context) - Goodrich, Shauck et al. - 1993
13 shortest paths among polygonal obstacles in the plane (context) - Mitchell - 1992
13 A comparative study on the path length performance of maze-s.. (context) - Lumelsky - 1991
13 A competitive analysis of algorithms for searching unknown s.. (context) - Kalyanasundaram, Pruhs - 1993
13 Parallel methods for visibility and shortest path problems i.. (context) - Goodrich, Shauck et al. - 1992
13 Finding the shortest watchman route in a simple polygon - Carlsson, Jonsson et al. - 1993
12 On shortest paths amidst convex polyhedra (context) - Sharir - 1987
12 An optimal algorithm for Euclidean shortest paths in the pla.. - Hershberger, Suri - 1995
12 link path in a polygon (context) - Mitchell, Piatko et al. - 1992
12 Optimization problems related to zigzag pocket machining - Arkin, Held et al. - 1996
12 Matrix searching with the shortest path metric - Hershberger, Suri - 1997
12 Computing of the geodesic center of a simple polygon (context) - Pollack, Sharir et al. - 1989
12 The maximum traveling salesman problem under polyhedral norm.. - Barvinok, Johnson et al. - 1998
12 The complexity of approximating the class Steiner tree probl.. - Ihler - 1992
12 The Euclidean traveling salesman problem is NP-complete (context) - Papadimitriou - 1977
12 factor approximation algorithm for the k-MST problem - Arya, Ramesh - 1998
12 Shortest paths in the plane with convex polygonal obstacles (context) - Rohnert - 1986
11 Going home through an unknown street (context) - L'opez-Ortiz, Schuierer - 1995
11 Shortest rectilinear paths among weighted obstacles (context) - Lee, Yang et al. - 1991
11 Mesh generation - Bern, Plassmann - 1998
11 An ffl-approximation algorithm for weighted shortest path qu.. (context) - Aleksandrov, Lanthier et al. - 1998
11 An ffl-approximation algorithm for weighted shortest paths o.. (context) - Aleksandrov, Lanthier et al. - 1998
11 Approximate kinodynamic planning using L 2 -norm dynamic bou.. - Reif, Tate - 1994
11 Computing the geodesic center of a simple polygon (context) - Asano, Toussaint - 1987
11 Optimal on-line algorithms for walking with minimum number o.. (context) - Ghosh, Saluja - 1997
11 Approximation algorithms for curvature constrained shortest .. - Wang, Agarwal - 1996
11 A stochastic approach to the weighted-region problem - Kindl, Shing et al. - 1991
11 On recognizing and characterizing visibility graphs of simpl.. (context) - Ghosh - 1997
11 Shortest path queries among weighted obstacles in the rectil.. (context) - Chen, Klenk et al. - 1995
11 A stochastic approach to the weighted-region problem - Kindl, Shing et al. - 1991
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ams.sunysb.edu/~jsbm/publications.html): More
A Constant-Factor Approximation Algorithm for the.. - Mitchell, Blum.. (1998) (Correct)
Evaluation of Collision Detection Methods for Virtual.. - Held, Klosowski.. (1995) (Correct)
On Minimum-Area Hulls - Arkin, Chiang, Held, Mitchell.. (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC