Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
A linear time algorithm with minimum link paths inside a simple polygon
Computer Vision, Graphics, and Image Processing
Path planning in 0/1/ weighted regions with applications
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
An output-sensitive algorithm for computing visibility
SIAM Journal on Computing
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Computing the full visibility graph of a set of line segments
Information Processing Letters
Optimal link path queries in a simple polygon
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Faster shortest-path algorithms for planar graphs
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Two-point Euclidean shortest path queries in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Finding minimal convex nested polygons
SCG '85 Proceedings of the first annual symposium on Computational geometry
An Optimal Algorithm for Euclidean Shortest Paths in the Plane
SIAM Journal on Computing
Sweeping simple polygons with a chain of guards
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Parametric search made practical
Proceedings of the eighteenth annual symposium on Computational geometry
Comparison of Distance Measures for Planar Curves
Algorithmica
Computing the Fréchet distance between simple polygons in polynomial time
Proceedings of the twenty-second annual symposium on Computational geometry
Guarding galleries and terrains
Information Processing Letters
Fréchet distance for curves, revisited
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Walking your dog in the woods in polynomial time
Proceedings of the twenty-fourth annual symposium on Computational geometry
Abstract Voronoi diagrams revisited
Computational Geometry: Theory and Applications
Link Distance and Shortest Path Problems in the Plane
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Querying Two Boundary Points for Shortest Paths in a Polygonal Domain
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
| Hi-index | 0.00 |
This paper describes algorithms to compute Voronoi diagrams, shortest path maps, the Hausdorff distance, and the Frechet distance in the plane with polygonal obstacles. The underlying distance measures for these algorithms are either shortest path distances or link distances. The link distance between a pair of points is the minimum number of edges needed to connect the two points with a polygonal path that avoids a set of obstacles. The motivation for minimizing the number of edges on a path comes from robotic motions and wireless communications because turns are more difficult in these settings than straight movements. Link-based Voronoi diagrams are different from traditional Voronoi diagrams because a query point in the interior of a Voronoi face can have multiple nearest sites. Our site-based Voronoi diagram ensures that all points in a face have the same set of nearest sites. Our distance-based Voronoi diagram ensures that all points in a face have the same distance to a nearest site. The shortest path maps in this paper support queries from any source point on a fixed line segment. This is a middle-ground approach because traditional shortest path maps typically support queries from either a fixed point or from all possible points in the plane. The Hausdorff distance and Frechet distance are fundamental similarity metrics for shape matching. This paper shows how to compute new variations of these metrics using shortest paths or link-based paths that avoid polygonal obstacles in the plane.