Geometric Shortest Paths and Network Optimization

By Joseph S. B. Mitchell. Handbook of Computational Geometry, 2000

475 citations recorded by the source corpus.

Subfields: Computer Graphics and Computer-Aided Design, Computer Vision and Pattern Recognition, Signal Processing

View Paper: https://www.semanticscholar.org/paper/1ad96ffee3a0b5e00d6996acf023615daad64845

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Graphics and Computer-Aided Design

1. Anthony Stentz
2. D. Ferguson
3. Jie Gao
4. Joseph S. B. Mitchell
5. Nathan D. Ratliff
6. J. Bagnell
7. David Silver

In Computer Vision and Pattern Recognition

1. Anthony Stentz
2. D. Ferguson
3. Joseph S. B. Mitchell
4. J. Bagnell
5. Nathan D. Ratliff
6. David Silver
7. Siddhartha S. Srinivasa

In Signal Processing

1. Anthony Stentz
2. D. Ferguson
3. Joseph S. B. Mitchell

Citations in the corpus

• Boundary recognition in sensor networks by topological methods (2006, background): “Proof. First we argue that all the inward concave vertices of R must be on the outer boundary of F � .B y the properties of geodesic shortest paths [ 21 ], all the vertices of R must be vertices of F � . If an inward concave vertex is a vertex of the inner hole, then we can move the concave vertex o”
• Using interpolation to improve path planning: The Field D* algorithm (2006, background): “A number of algorithms exist to solve this problem in the computational geometry literature ͓see Mitchell ͑2000͒ for a good survey͔.”