Computing Shortest Paths among Curved Obstacles in the Plane
Work
Year: 2015
Type: article
Abstract: A fundamental problem in computational geometry is to compute an obstacle-avoiding Euclidean shortest path between two points in the plane. The case of this problem on polygonal obstacles is well stud... more
Source: ACM Transactions on Algorithms
Authors Danny Z. Chen, Haitao Wang
Institutions University of Notre Dame, Utah State University
Cites: 42
Cited by: 20
Related to: 10
FWCI: 3.549
Citation percentile (by year/subfield): 96.81
Field: Computer Science
Domain: Physical Sciences
Open Access status: green